./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.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_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:41,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:42,002 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:42,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:42,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:42,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:42,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:42,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:42,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:42,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:42,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:42,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:42,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:42,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:42,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:42,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:42,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:42,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:42,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:42,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:42,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:42,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:42,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:42,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:42,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:42,036 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2025-03-17 14:16:42,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:42,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:42,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:42,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:42,280 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:42,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-17 14:16:43,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60f3c58/e3f326d68b36442d8c883fdf92b3f817/FLAG255c487d4 [2025-03-17 14:16:43,691 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:43,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-17 14:16:43,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60f3c58/e3f326d68b36442d8c883fdf92b3f817/FLAG255c487d4 [2025-03-17 14:16:43,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60f3c58/e3f326d68b36442d8c883fdf92b3f817 [2025-03-17 14:16:43,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:43,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:43,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:43,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:43,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:43,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:43" (1/1) ... [2025-03-17 14:16:43,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cad976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:43, skipping insertion in model container [2025-03-17 14:16:43,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:43" (1/1) ... [2025-03-17 14:16:43,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:16:43,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:44,012 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:16:44,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:44,077 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:16:44,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:44 WrapperNode [2025-03-17 14:16:44,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:44,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:44,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:16:44,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:16:44,082 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:44" (1/1) ... [2025-03-17 14:16:44,090 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:44" (1/1) ... [2025-03-17 14:16:44,108 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2025-03-17 14:16:44,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:44,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:16:44,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:16:44,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:16:44,116 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:44" (1/1) ... [2025-03-17 14:16:44,116 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:44" (1/1) ... [2025-03-17 14:16:44,118 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:44" (1/1) ... [2025-03-17 14:16:44,128 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:44,128 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:44" (1/1) ... [2025-03-17 14:16:44,128 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:44" (1/1) ... [2025-03-17 14:16:44,133 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:44" (1/1) ... [2025-03-17 14:16:44,133 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:44" (1/1) ... [2025-03-17 14:16:44,134 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:44" (1/1) ... [2025-03-17 14:16:44,134 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:44" (1/1) ... [2025-03-17 14:16:44,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:16:44,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:16:44,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:16:44,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:16:44,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:44" (1/1) ... [2025-03-17 14:16:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:44,181 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:44,183 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:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:16:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:16:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:16:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:16:44,197 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:44,280 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:16:44,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:16:44,462 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:16:44,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:16:44,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:16:44,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:16:44,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:44 BoogieIcfgContainer [2025-03-17 14:16:44,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:16:44,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:16:44,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:16:44,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:16:44,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:43" (1/3) ... [2025-03-17 14:16:44,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21300e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:44, skipping insertion in model container [2025-03-17 14:16:44,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:44" (2/3) ... [2025-03-17 14:16:44,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21300e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:44, skipping insertion in model container [2025-03-17 14:16:44,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:44" (3/3) ... [2025-03-17 14:16:44,689 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-17 14:16:44,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:16:44,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 9 error locations. [2025-03-17 14:16:44,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:16:44,735 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:16:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 70 flow [2025-03-17 14:16:44,785 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-17 14:16:44,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-17 14:16:44,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 70 flow [2025-03-17 14:16:44,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 67 flow [2025-03-17 14:16:44,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:16:44,811 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;@4c59d050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:16:44,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:16:44,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:16:44,818 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-17 14:16:44,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:44,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:44,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:16:44,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 791589828, now seen corresponding path program 1 times [2025-03-17 14:16:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764969537] [2025-03-17 14:16:44,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:16:44,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:16:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:45,034 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:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:45,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764969537] [2025-03-17 14:16:45,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764969537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:45,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960336000] [2025-03-17 14:16:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:45,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:45,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:45,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:45,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-17 14:16:45,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 67 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:45,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:45,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-17 14:16:45,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:45,163 INFO L124 PetriNetUnfolderBase]: 74/206 cut-off events. [2025-03-17 14:16:45,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:45,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 206 events. 74/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 934 event pairs, 56 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 345. Up to 149 conditions per place. [2025-03-17 14:16:45,167 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-17 14:16:45,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 113 flow [2025-03-17 14:16:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-17 14:16:45,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-03-17 14:16:45,177 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 67 flow. Second operand 3 states and 59 transitions. [2025-03-17 14:16:45,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 113 flow [2025-03-17 14:16:45,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:45,183 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 78 flow [2025-03-17 14:16:45,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-17 14:16:45,187 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-17 14:16:45,187 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 78 flow [2025-03-17 14:16:45,188 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:45,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:45,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:45,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:16:45,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:45,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1280326529, now seen corresponding path program 1 times [2025-03-17 14:16:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072764135] [2025-03-17 14:16:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:45,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:45,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:16:45,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:16:45,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:45,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072764135] [2025-03-17 14:16:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072764135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54474860] [2025-03-17 14:16:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:45,322 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:45,324 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:45,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:16:45,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:16:45,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:45,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:45,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:16:45,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:16:45,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:16:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54474860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:16:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2025-03-17 14:16:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19008897] [2025-03-17 14:16:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:45,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:45,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:45,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:45,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-17 14:16:45,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:45,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:45,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-17 14:16:45,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:45,494 INFO L124 PetriNetUnfolderBase]: 74/204 cut-off events. [2025-03-17 14:16:45,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:45,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 204 events. 74/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 916 event pairs, 56 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 353. Up to 149 conditions per place. [2025-03-17 14:16:45,496 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 21 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-03-17 14:16:45,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 120 flow [2025-03-17 14:16:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-17 14:16:45,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-17 14:16:45,497 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 55 transitions. [2025-03-17 14:16:45,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 120 flow [2025-03-17 14:16:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 116 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:45,498 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 74 flow [2025-03-17 14:16:45,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-03-17 14:16:45,499 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-17 14:16:45,499 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 74 flow [2025-03-17 14:16:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:45,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:45,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:45,506 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:45,703 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:45,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2033162448, now seen corresponding path program 1 times [2025-03-17 14:16:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994448699] [2025-03-17 14:16:45,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:45,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:16:45,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:16:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:45,785 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:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994448699] [2025-03-17 14:16:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994448699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294618362] [2025-03-17 14:16:45,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:45,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:45,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:45,788 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:45,791 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:45,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:16:45,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:16:45,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:45,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:16:45,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:45,895 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:45,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:45,914 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:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294618362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:45,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:16:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121578481] [2025-03-17 14:16:45,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:45,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:16:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:45,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:16:45,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:16:45,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-17 14:16:45,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:45,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:45,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-17 14:16:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:45,986 INFO L124 PetriNetUnfolderBase]: 74/207 cut-off events. [2025-03-17 14:16:45,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:45,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 207 events. 74/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 923 event pairs, 56 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 364. Up to 149 conditions per place. [2025-03-17 14:16:45,989 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2025-03-17 14:16:45,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 136 flow [2025-03-17 14:16:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:16:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:16:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2025-03-17 14:16:45,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2025-03-17 14:16:45,992 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 74 flow. Second operand 6 states and 100 transitions. [2025-03-17 14:16:45,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 136 flow [2025-03-17 14:16:45,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:45,993 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 109 flow [2025-03-17 14:16:45,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-17 14:16:45,993 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-03-17 14:16:45,993 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 109 flow [2025-03-17 14:16:45,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:45,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:45,994 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:46,002 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:46,194 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,SelfDestructingSolverStorable2 [2025-03-17 14:16:46,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash 651280373, now seen corresponding path program 2 times [2025-03-17 14:16:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802244343] [2025-03-17 14:16:46,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:46,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:16:46,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-03-17 14:16:46,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:16:46,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:46,307 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:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802244343] [2025-03-17 14:16:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802244343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166107286] [2025-03-17 14:16:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:46,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:46,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:46,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:46,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:46,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:46,399 INFO L124 PetriNetUnfolderBase]: 74/196 cut-off events. [2025-03-17 14:16:46,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:46,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 196 events. 74/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 800 event pairs, 21 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 364. Up to 80 conditions per place. [2025-03-17 14:16:46,401 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 30 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-03-17 14:16:46,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 187 flow [2025-03-17 14:16:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-17 14:16:46,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-17 14:16:46,402 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 109 flow. Second operand 4 states and 71 transitions. [2025-03-17 14:16:46,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 187 flow [2025-03-17 14:16:46,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 173 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:46,405 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 97 flow [2025-03-17 14:16:46,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2025-03-17 14:16:46,406 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-03-17 14:16:46,407 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 97 flow [2025-03-17 14:16:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:46,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:46,407 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:46,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:16:46,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:46,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 651280374, now seen corresponding path program 1 times [2025-03-17 14:16:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587738319] [2025-03-17 14:16:46,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:46,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:16:46,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:16:46,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:46,554 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:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587738319] [2025-03-17 14:16:46,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587738319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407254517] [2025-03-17 14:16:46,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:46,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:46,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:46,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:16:46,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:16:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:16:46,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:16:46,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:46,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:46,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:16:46,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:46,646 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:46,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:46,691 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:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407254517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:46,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:16:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846581374] [2025-03-17 14:16:46,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:46,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:16:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:46,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:16:46,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:16:46,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-17 14:16:46,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 97 flow. Second operand has 13 states, 13 states have (on average 13.384615384615385) internal successors, (174), 13 states have internal predecessors, (174), 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:46,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:46,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-17 14:16:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:46,765 INFO L124 PetriNetUnfolderBase]: 74/205 cut-off events. [2025-03-17 14:16:46,765 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 14:16:46,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 205 events. 74/205 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 839 event pairs, 56 based on Foata normal form. 6/187 useless extension candidates. Maximal degree in co-relation 401. Up to 149 conditions per place. [2025-03-17 14:16:46,766 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2025-03-17 14:16:46,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 195 flow [2025-03-17 14:16:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2025-03-17 14:16:46,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45707070707070707 [2025-03-17 14:16:46,767 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 97 flow. Second operand 12 states and 181 transitions. [2025-03-17 14:16:46,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 195 flow [2025-03-17 14:16:46,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:16:46,770 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 175 flow [2025-03-17 14:16:46,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-03-17 14:16:46,770 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2025-03-17 14:16:46,770 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 175 flow [2025-03-17 14:16:46,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.384615384615385) internal successors, (174), 13 states have internal predecessors, (174), 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:46,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:46,771 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:46,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:16:46,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:46,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:46,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash -665459178, now seen corresponding path program 2 times [2025-03-17 14:16:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:46,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133968454] [2025-03-17 14:16:46,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:46,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:16:46,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 18 statements. [2025-03-17 14:16:46,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:16:46,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:47,080 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:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133968454] [2025-03-17 14:16:47,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133968454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:47,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:47,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:47,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454143363] [2025-03-17 14:16:47,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:47,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:16:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:47,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:16:47,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:47,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:47,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:47,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:47,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:47,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:47,240 INFO L124 PetriNetUnfolderBase]: 138/312 cut-off events. [2025-03-17 14:16:47,240 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 14:16:47,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 312 events. 138/312 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1124 event pairs, 70 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 643. Up to 190 conditions per place. [2025-03-17 14:16:47,242 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 51 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-17 14:16:47,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 329 flow [2025-03-17 14:16:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:16:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:16:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-17 14:16:47,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2025-03-17 14:16:47,243 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 175 flow. Second operand 5 states and 98 transitions. [2025-03-17 14:16:47,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 329 flow [2025-03-17 14:16:47,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 281 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-17 14:16:47,246 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 153 flow [2025-03-17 14:16:47,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2025-03-17 14:16:47,246 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2025-03-17 14:16:47,246 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 153 flow [2025-03-17 14:16:47,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:47,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:47,247 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:16:47,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash -647179559, now seen corresponding path program 1 times [2025-03-17 14:16:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597260285] [2025-03-17 14:16:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:47,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:16:47,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:16:47,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:47,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:47,321 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:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:47,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597260285] [2025-03-17 14:16:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597260285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:47,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318749462] [2025-03-17 14:16:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:47,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:16:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:47,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:16:47,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:16:47,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:47,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:47,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:47,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:47,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:47,401 INFO L124 PetriNetUnfolderBase]: 122/311 cut-off events. [2025-03-17 14:16:47,402 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-17 14:16:47,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 311 events. 122/311 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1252 event pairs, 28 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 657. Up to 150 conditions per place. [2025-03-17 14:16:47,403 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 41 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-03-17 14:16:47,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 275 flow [2025-03-17 14:16:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:16:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:16:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-17 14:16:47,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 14:16:47,404 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 153 flow. Second operand 4 states and 72 transitions. [2025-03-17 14:16:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 275 flow [2025-03-17 14:16:47,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:47,407 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 151 flow [2025-03-17 14:16:47,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-03-17 14:16:47,407 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2025-03-17 14:16:47,407 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 151 flow [2025-03-17 14:16:47,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:47,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:47,408 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:47,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:16:47,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:47,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash -647179558, now seen corresponding path program 1 times [2025-03-17 14:16:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822516301] [2025-03-17 14:16:47,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:47,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:16:47,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:16:47,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:47,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:47,591 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:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:47,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822516301] [2025-03-17 14:16:47,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822516301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:47,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:47,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:16:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766047681] [2025-03-17 14:16:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:16:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:47,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:16:47,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:16:47,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:47,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:47,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:47,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:47,725 INFO L124 PetriNetUnfolderBase]: 242/532 cut-off events. [2025-03-17 14:16:47,725 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-17 14:16:47,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 532 events. 242/532 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2207 event pairs, 108 based on Foata normal form. 15/501 useless extension candidates. Maximal degree in co-relation 1224. Up to 314 conditions per place. [2025-03-17 14:16:47,727 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-03-17 14:16:47,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 365 flow [2025-03-17 14:16:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:16:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:16:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-03-17 14:16:47,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-17 14:16:47,734 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 151 flow. Second operand 5 states and 100 transitions. [2025-03-17 14:16:47,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 365 flow [2025-03-17 14:16:47,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:16:47,736 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 171 flow [2025-03-17 14:16:47,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-03-17 14:16:47,736 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2025-03-17 14:16:47,736 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 171 flow [2025-03-17 14:16:47,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:47,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:47,737 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:47,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:16:47,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:47,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -135582993, now seen corresponding path program 1 times [2025-03-17 14:16:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:47,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823947871] [2025-03-17 14:16:47,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:16:47,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:16:47,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:47,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:47,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823947871] [2025-03-17 14:16:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823947871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349832347] [2025-03-17 14:16:47,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:47,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:47,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:16:47,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:16:47,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:16:47,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:16:47,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:47,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:48,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:16:48,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:48,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:48,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349832347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:48,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:48,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 14:16:48,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381340060] [2025-03-17 14:16:48,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:48,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:16:48,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:48,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:16:48,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:16:48,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:48,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 171 flow. Second operand has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 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,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:48,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:48,835 INFO L124 PetriNetUnfolderBase]: 478/1044 cut-off events. [2025-03-17 14:16:48,835 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2025-03-17 14:16:48,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 1044 events. 478/1044 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4413 event pairs, 64 based on Foata normal form. 98/1094 useless extension candidates. Maximal degree in co-relation 2504. Up to 210 conditions per place. [2025-03-17 14:16:48,840 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 136 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2025-03-17 14:16:48,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 152 transitions, 843 flow [2025-03-17 14:16:48,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions. [2025-03-17 14:16:48,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-03-17 14:16:48,842 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 171 flow. Second operand 12 states and 248 transitions. [2025-03-17 14:16:48,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 152 transitions, 843 flow [2025-03-17 14:16:48,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 152 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:48,844 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 246 flow [2025-03-17 14:16:48,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2025-03-17 14:16:48,847 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 41 predicate places. [2025-03-17 14:16:48,847 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 246 flow [2025-03-17 14:16:48,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 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,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:48,848 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:16:48,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:16:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:49,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1128445184, now seen corresponding path program 1 times [2025-03-17 14:16:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317854540] [2025-03-17 14:16:49,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:49,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:16:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:16:49,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:49,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317854540] [2025-03-17 14:16:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317854540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032675848] [2025-03-17 14:16:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:49,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:16:49,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:16:49,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:16:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:16:49,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:49,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:16:49,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:49,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:49,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032675848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:49,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:49,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 14:16:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521695841] [2025-03-17 14:16:49,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:49,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:16:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:49,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:16:49,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:16:49,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:49,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 47 transitions, 246 flow. Second operand has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 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,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:49,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:50,194 INFO L124 PetriNetUnfolderBase]: 1091/2369 cut-off events. [2025-03-17 14:16:50,194 INFO L125 PetriNetUnfolderBase]: For 2646/2646 co-relation queries the response was YES. [2025-03-17 14:16:50,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6403 conditions, 2369 events. 1091/2369 cut-off events. For 2646/2646 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12515 event pairs, 160 based on Foata normal form. 231/2567 useless extension candidates. Maximal degree in co-relation 6373. Up to 410 conditions per place. [2025-03-17 14:16:50,206 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 215 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2025-03-17 14:16:50,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 230 transitions, 1742 flow [2025-03-17 14:16:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2025-03-17 14:16:50,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2025-03-17 14:16:50,208 INFO L175 Difference]: Start difference. First operand has 74 places, 47 transitions, 246 flow. Second operand 12 states and 257 transitions. [2025-03-17 14:16:50,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 230 transitions, 1742 flow [2025-03-17 14:16:50,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 230 transitions, 1561 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-17 14:16:50,213 INFO L231 Difference]: Finished difference. Result has 88 places, 53 transitions, 306 flow [2025-03-17 14:16:50,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=306, PETRI_PLACES=88, PETRI_TRANSITIONS=53} [2025-03-17 14:16:50,214 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2025-03-17 14:16:50,214 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 53 transitions, 306 flow [2025-03-17 14:16:50,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.0) internal successors, (182), 14 states have internal predecessors, (182), 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,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:50,215 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 14:16:50,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:16:50,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:16:50,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1962659370, now seen corresponding path program 2 times [2025-03-17 14:16:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077236493] [2025-03-17 14:16:50,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:50,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 14:16:50,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:16:50,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:16:50,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077236493] [2025-03-17 14:16:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077236493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920886406] [2025-03-17 14:16:50,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:50,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:16:50,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:16:50,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 14:16:50,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:16:50,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:16:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:50,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:16:50,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:51,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920886406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:51,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-17 14:16:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736344477] [2025-03-17 14:16:51,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:51,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:16:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:16:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:16:51,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:51,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 53 transitions, 306 flow. Second operand has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:51,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:51,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:51,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:52,697 INFO L124 PetriNetUnfolderBase]: 1250/2714 cut-off events. [2025-03-17 14:16:52,697 INFO L125 PetriNetUnfolderBase]: For 4397/4397 co-relation queries the response was YES. [2025-03-17 14:16:52,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 2714 events. 1250/2714 cut-off events. For 4397/4397 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 14458 event pairs, 31 based on Foata normal form. 96/2810 useless extension candidates. Maximal degree in co-relation 7966. Up to 320 conditions per place. [2025-03-17 14:16:52,711 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 246 selfloop transitions, 15 changer transitions 13/277 dead transitions. [2025-03-17 14:16:52,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 277 transitions, 2198 flow [2025-03-17 14:16:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:16:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 14:16:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 300 transitions. [2025-03-17 14:16:52,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-17 14:16:52,712 INFO L175 Difference]: Start difference. First operand has 88 places, 53 transitions, 306 flow. Second operand 15 states and 300 transitions. [2025-03-17 14:16:52,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 277 transitions, 2198 flow [2025-03-17 14:16:52,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 277 transitions, 1955 flow, removed 91 selfloop flow, removed 7 redundant places. [2025-03-17 14:16:52,720 INFO L231 Difference]: Finished difference. Result has 95 places, 53 transitions, 304 flow [2025-03-17 14:16:52,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=304, PETRI_PLACES=95, PETRI_TRANSITIONS=53} [2025-03-17 14:16:52,720 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2025-03-17 14:16:52,720 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 53 transitions, 304 flow [2025-03-17 14:16:52,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:52,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:52,721 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 14:16:52,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:16:52,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:52,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:16:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1972827482, now seen corresponding path program 2 times [2025-03-17 14:16:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278104949] [2025-03-17 14:16:52,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:52,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 14:16:52,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:16:52,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:16:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278104949] [2025-03-17 14:16:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278104949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900086598] [2025-03-17 14:16:53,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:53,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:53,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:16:53,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:16:53,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 14:16:53,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:16:53,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:16:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:53,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:16:53,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:53,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:16:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900086598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:53,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-17 14:16:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011827513] [2025-03-17 14:16:53,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:16:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:53,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:16:53,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:16:54,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-17 14:16:54,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 53 transitions, 304 flow. Second operand has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:54,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:54,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-17 14:16:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:55,373 INFO L124 PetriNetUnfolderBase]: 2420/5246 cut-off events. [2025-03-17 14:16:55,373 INFO L125 PetriNetUnfolderBase]: For 8933/8933 co-relation queries the response was YES. [2025-03-17 14:16:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15236 conditions, 5246 events. 2420/5246 cut-off events. For 8933/8933 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 29763 event pairs, 0 based on Foata normal form. 234/5480 useless extension candidates. Maximal degree in co-relation 15200. Up to 547 conditions per place. [2025-03-17 14:16:55,435 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 0 selfloop transitions, 0 changer transitions 518/518 dead transitions. [2025-03-17 14:16:55,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 518 transitions, 4145 flow [2025-03-17 14:16:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:16:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 14:16:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 510 transitions. [2025-03-17 14:16:55,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2025-03-17 14:16:55,438 INFO L175 Difference]: Start difference. First operand has 95 places, 53 transitions, 304 flow. Second operand 24 states and 510 transitions. [2025-03-17 14:16:55,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 518 transitions, 4145 flow [2025-03-17 14:16:55,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 518 transitions, 3585 flow, removed 73 selfloop flow, removed 18 redundant places. [2025-03-17 14:16:55,454 INFO L231 Difference]: Finished difference. Result has 98 places, 0 transitions, 0 flow [2025-03-17 14:16:55,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=0, PETRI_PLACES=98, PETRI_TRANSITIONS=0} [2025-03-17 14:16:55,455 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2025-03-17 14:16:55,456 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 0 transitions, 0 flow [2025-03-17 14:16:55,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.173913043478262) internal successors, (326), 23 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:55,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2025-03-17 14:16:55,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-17 14:16:55,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-17 14:16:55,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-17 14:16:55,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:16:55,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:55,660 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:16:55,663 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:16:55,663 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:16:55,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:16:55 BasicIcfg [2025-03-17 14:16:55,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:16:55,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:16:55,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:16:55,669 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:16:55,670 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:44" (3/4) ... [2025-03-17 14:16:55,671 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:16:55,673 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-17 14:16:55,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2025-03-17 14:16:55,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-17 14:16:55,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 14:16:55,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 14:16:55,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:16:55,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:16:55,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:16:55,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:16:55,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:16:55,735 INFO L158 Benchmark]: Toolchain (without parser) took 12016.99ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 113.4MB in the beginning and 238.6MB in the end (delta: -125.3MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,735 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.57ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 84.0MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.32ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,737 INFO L158 Benchmark]: Boogie Preprocessor took 26.21ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,737 INFO L158 Benchmark]: IcfgBuilder took 545.25ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 72.2MB in the end (delta: 7.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,737 INFO L158 Benchmark]: TraceAbstraction took 10986.29ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.4MB in the beginning and 245.9MB in the end (delta: -174.5MB). Peak memory consumption was 228.1MB. Max. memory is 16.1GB. [2025-03-17 14:16:55,738 INFO L158 Benchmark]: Witness Printer took 65.17ms. Allocated memory is still 360.7MB. Free memory was 245.9MB in the beginning and 238.6MB in the end (delta: 7.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:16:55,739 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.32ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.57ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 84.0MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.32ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.21ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.25ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 72.2MB in the end (delta: 7.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10986.29ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.4MB in the beginning and 245.9MB in the end (delta: -174.5MB). Peak memory consumption was 228.1MB. Max. memory is 16.1GB. * Witness Printer took 65.17ms. Allocated memory is still 360.7MB. Free memory was 245.9MB in the beginning and 238.6MB in the end (delta: 7.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 932]: 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 - 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, 45 locations, 47 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: 10.9s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2103 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2013 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4557 IncrementalHoareTripleChecker+Invalid, 4593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 19 mSDtfsCounter, 4557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=10, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 412 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 6925 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1939 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 945/1242 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:55,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE