./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:36,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:36,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:36,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:36,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:36,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:36,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:36,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:36,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:36,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:36,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:36,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:36,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:36,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:36,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:36,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:36,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:36,558 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:36,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:36,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:36,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:36,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:36,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:36,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:36,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:36,559 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-04 09:44:36,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:36,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:36,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:36,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:36,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:36,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 09:44:37,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d11c00f/c5601fb1e126461a8622d756cee68fa1/FLAG19b2bf122 [2025-03-04 09:44:38,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:38,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 09:44:38,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d11c00f/c5601fb1e126461a8622d756cee68fa1/FLAG19b2bf122 [2025-03-04 09:44:38,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d11c00f/c5601fb1e126461a8622d756cee68fa1 [2025-03-04 09:44:38,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:38,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:38,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:38,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:38,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:38,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1925ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38, skipping insertion in model container [2025-03-04 09:44:38,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:38,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:38,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:38,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:38,694 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:38,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38 WrapperNode [2025-03-04 09:44:38,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:38,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:38,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:38,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:38,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,733 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2025-03-04 09:44:38,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:38,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:38,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:38,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:38,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,759 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 09:44:38,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:38,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:38,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:38,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:38,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (1/1) ... [2025-03-04 09:44:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:38,809 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-04 09:44:38,812 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-04 09:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:44:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:38,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:38,831 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:38,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:38,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:39,119 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:39,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:39,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:39,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:39,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:39 BoogieIcfgContainer [2025-03-04 09:44:39,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:39,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:39,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:39,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:38" (1/3) ... [2025-03-04 09:44:39,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3a00b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:39, skipping insertion in model container [2025-03-04 09:44:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:38" (2/3) ... [2025-03-04 09:44:39,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3a00b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:39, skipping insertion in model container [2025-03-04 09:44:39,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:39" (3/3) ... [2025-03-04 09:44:39,258 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-04 09:44:39,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:39,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 09:44:39,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:39,313 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:39,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 78 flow [2025-03-04 09:44:39,363 INFO L124 PetriNetUnfolderBase]: 5/41 cut-off events. [2025-03-04 09:44:39,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 41 events. 5/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-04 09:44:39,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 78 flow [2025-03-04 09:44:39,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 78 flow [2025-03-04 09:44:39,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:39,384 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;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:39,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 09:44:39,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:39,388 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:39,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:39,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:39,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:39,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash 254360, now seen corresponding path program 1 times [2025-03-04 09:44:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-04 09:44:39,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:39,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:39,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:39,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:39,610 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-04 09:44:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-04 09:44:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520830732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:39,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713150930] [2025-03-04 09:44:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:39,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:39,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:39,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-04 09:44:39,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-04 09:44:39,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:39,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-04 09:44:39,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:39,708 INFO L124 PetriNetUnfolderBase]: 23/86 cut-off events. [2025-03-04 09:44:39,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:39,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 86 events. 23/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 237 event pairs, 16 based on Foata normal form. 6/85 useless extension candidates. Maximal degree in co-relation 123. Up to 51 conditions per place. [2025-03-04 09:44:39,711 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 15 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-03-04 09:44:39,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 94 flow [2025-03-04 09:44:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-04 09:44:39,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 09:44:39,723 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 78 flow. Second operand 3 states and 63 transitions. [2025-03-04 09:44:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 94 flow [2025-03-04 09:44:39,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:39,727 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 64 flow [2025-03-04 09:44:39,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-04 09:44:39,731 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-03-04 09:44:39,731 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 64 flow [2025-03-04 09:44:39,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-04 09:44:39,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:39,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:39,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:39,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 254361, now seen corresponding path program 1 times [2025-03-04 09:44:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-04 09:44:39,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:39,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:39,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:39,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:39,847 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-04 09:44:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-04 09:44:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360294191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:39,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:39,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:39,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024945763] [2025-03-04 09:44:39,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:39,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:39,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:39,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:39,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 09:44:39,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-04 09:44:39,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:39,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 09:44:39,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:39,911 INFO L124 PetriNetUnfolderBase]: 23/88 cut-off events. [2025-03-04 09:44:39,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:39,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 88 events. 23/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 237 event pairs, 16 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 142. Up to 53 conditions per place. [2025-03-04 09:44:39,912 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 17 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-04 09:44:39,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 106 flow [2025-03-04 09:44:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 09:44:39,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-04 09:44:39,913 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 64 flow. Second operand 3 states and 66 transitions. [2025-03-04 09:44:39,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 106 flow [2025-03-04 09:44:39,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:39,915 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 77 flow [2025-03-04 09:44:39,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-03-04 09:44:39,915 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-03-04 09:44:39,915 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 77 flow [2025-03-04 09:44:39,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-04 09:44:39,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:39,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:39,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:39,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash 244449266, now seen corresponding path program 1 times [2025-03-04 09:44:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-04 09:44:39,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:39,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-04 09:44:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69518914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274602930] [2025-03-04 09:44:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:40,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:40,074 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-04 09:44:40,076 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-04 09:44:40,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:40,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:40,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:40,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274602930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:40,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696086559] [2025-03-04 09:44:40,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:40,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:40,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:40,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:40,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 09:44:40,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 77 flow. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 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-04 09:44:40,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:40,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 09:44:40,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:40,430 INFO L124 PetriNetUnfolderBase]: 25/96 cut-off events. [2025-03-04 09:44:40,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:40,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 96 events. 25/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 254 event pairs, 16 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 168. Up to 55 conditions per place. [2025-03-04 09:44:40,432 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 20 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2025-03-04 09:44:40,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 159 flow [2025-03-04 09:44:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-04 09:44:40,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545045045045045 [2025-03-04 09:44:40,433 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 77 flow. Second operand 6 states and 121 transitions. [2025-03-04 09:44:40,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 159 flow [2025-03-04 09:44:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:40,434 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 127 flow [2025-03-04 09:44:40,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-04 09:44:40,435 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-03-04 09:44:40,435 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 127 flow [2025-03-04 09:44:40,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 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-04 09:44:40,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:40,435 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:40,442 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-04 09:44:40,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:40,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1079078269, now seen corresponding path program 2 times [2025-03-04 09:44:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141473558] [2025-03-04 09:44:40,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:40,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:40,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:40,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141473558] [2025-03-04 09:44:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141473558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195380060] [2025-03-04 09:44:40,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:40,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:40,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:40,882 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-04 09:44:40,885 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-04 09:44:40,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:40,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:40,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:40,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:40,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:40,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195380060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940507422] [2025-03-04 09:44:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:41,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:41,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 09:44:41,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 127 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-04 09:44:41,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 09:44:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:41,209 INFO L124 PetriNetUnfolderBase]: 25/95 cut-off events. [2025-03-04 09:44:41,209 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:44:41,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 95 events. 25/95 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 253 event pairs, 16 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 177. Up to 51 conditions per place. [2025-03-04 09:44:41,210 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 16 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2025-03-04 09:44:41,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 177 flow [2025-03-04 09:44:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-03-04 09:44:41,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2025-03-04 09:44:41,211 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 127 flow. Second operand 8 states and 147 transitions. [2025-03-04 09:44:41,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 177 flow [2025-03-04 09:44:41,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 151 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:41,213 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 119 flow [2025-03-04 09:44:41,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 09:44:41,213 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 09:44:41,213 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 119 flow [2025-03-04 09:44:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-04 09:44:41,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,220 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-04 09:44:41,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 09:44:41,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1094774599, now seen corresponding path program 1 times [2025-03-04 09:44:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-03-04 09:44:41,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:41,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:41,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-03-04 09:44:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998185862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277083518] [2025-03-04 09:44:41,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:41,473 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-04 09:44:41,475 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-04 09:44:41,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:41,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:41,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277083518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:41,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161705667] [2025-03-04 09:44:41,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:41,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:41,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2025-03-04 09:44:41,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 119 flow. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-04 09:44:41,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2025-03-04 09:44:41,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:41,634 INFO L124 PetriNetUnfolderBase]: 23/96 cut-off events. [2025-03-04 09:44:41,634 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 09:44:41,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 96 events. 23/96 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 234 event pairs, 16 based on Foata normal form. 4/94 useless extension candidates. Maximal degree in co-relation 183. Up to 50 conditions per place. [2025-03-04 09:44:41,634 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 19 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2025-03-04 09:44:41,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 190 flow [2025-03-04 09:44:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2025-03-04 09:44:41,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2025-03-04 09:44:41,636 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 119 flow. Second operand 8 states and 159 transitions. [2025-03-04 09:44:41,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 190 flow [2025-03-04 09:44:41,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 172 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:41,637 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 131 flow [2025-03-04 09:44:41,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2025-03-04 09:44:41,638 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-04 09:44:41,638 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 131 flow [2025-03-04 09:44:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-04 09:44:41,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,638 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,645 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-04 09:44:41,840 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-04 09:44:41,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 432428843, now seen corresponding path program 2 times [2025-03-04 09:44:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:41,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161165635] [2025-03-04 09:44:41,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:41,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:41,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:41,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:41,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:41,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:41,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:44:41,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:41,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:41,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:41,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:41,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 09:44:41,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-04 09:44:41,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-04 09:44:41,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-04 09:44:41,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-03-04 09:44:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:41,918 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-04 09:44:41,921 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:41,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:41,941 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:41,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 62 transitions, 134 flow [2025-03-04 09:44:41,950 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2025-03-04 09:44:41,950 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:41,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 71 events. 9/71 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 212 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-03-04 09:44:41,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 62 transitions, 134 flow [2025-03-04 09:44:41,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 62 transitions, 134 flow [2025-03-04 09:44:41,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:41,954 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;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:41,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 09:44:41,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:41,955 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:41,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:41,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:41,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 315926, now seen corresponding path program 1 times [2025-03-04 09:44:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-04 09:44:41,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:41,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:41,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:41,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,986 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-04 09:44:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-04 09:44:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923507808] [2025-03-04 09:44:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:41,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:42,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 09:44:42,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-04 09:44:42,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:42,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 09:44:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:42,118 INFO L124 PetriNetUnfolderBase]: 449/1046 cut-off events. [2025-03-04 09:44:42,118 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 09:44:42,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 1046 events. 449/1046 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6214 event pairs, 376 based on Foata normal form. 160/1136 useless extension candidates. Maximal degree in co-relation 1011. Up to 708 conditions per place. [2025-03-04 09:44:42,129 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 25 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-04 09:44:42,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 162 flow [2025-03-04 09:44:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-04 09:44:42,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2025-03-04 09:44:42,131 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 134 flow. Second operand 3 states and 109 transitions. [2025-03-04 09:44:42,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 162 flow [2025-03-04 09:44:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:42,132 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 112 flow [2025-03-04 09:44:42,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-04 09:44:42,134 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2025-03-04 09:44:42,134 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 112 flow [2025-03-04 09:44:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-04 09:44:42,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:42,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:42,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:42,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash 315927, now seen corresponding path program 1 times [2025-03-04 09:44:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-04 09:44:42,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:42,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:42,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:42,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:42,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:42,163 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-04 09:44:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-04 09:44:42,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963158272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:42,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:42,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167239274] [2025-03-04 09:44:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:42,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:42,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:42,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:42,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 09:44:42,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 09:44:42,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:42,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 09:44:42,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:42,301 INFO L124 PetriNetUnfolderBase]: 449/1048 cut-off events. [2025-03-04 09:44:42,302 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 09:44:42,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1048 events. 449/1048 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6224 event pairs, 376 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1786. Up to 710 conditions per place. [2025-03-04 09:44:42,308 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-04 09:44:42,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 174 flow [2025-03-04 09:44:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-04 09:44:42,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-04 09:44:42,309 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 112 flow. Second operand 3 states and 112 transitions. [2025-03-04 09:44:42,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 174 flow [2025-03-04 09:44:42,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:42,311 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 125 flow [2025-03-04 09:44:42,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-04 09:44:42,312 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-04 09:44:42,312 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 125 flow [2025-03-04 09:44:42,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-04 09:44:42,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:42,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:42,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:42,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 303616176, now seen corresponding path program 1 times [2025-03-04 09:44:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108782451] [2025-03-04 09:44:42,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:42,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:42,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:42,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:42,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:42,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108782451] [2025-03-04 09:44:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108782451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798904773] [2025-03-04 09:44:42,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:42,383 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-04 09:44:42,386 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-04 09:44:42,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:42,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:42,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:42,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:42,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:42,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:42,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:42,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798904773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:42,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-03-04 09:44:42,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:42,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:42,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:42,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:42,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 09:44:42,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-04 09:44:42,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:42,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 09:44:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:42,758 INFO L124 PetriNetUnfolderBase]: 451/1056 cut-off events. [2025-03-04 09:44:42,758 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 09:44:42,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 1056 events. 451/1056 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6208 event pairs, 376 based on Foata normal form. 1/987 useless extension candidates. Maximal degree in co-relation 1812. Up to 712 conditions per place. [2025-03-04 09:44:42,762 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 30 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-04 09:44:42,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 227 flow [2025-03-04 09:44:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-04 09:44:42,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456989247311828 [2025-03-04 09:44:42,763 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 125 flow. Second operand 6 states and 203 transitions. [2025-03-04 09:44:42,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 227 flow [2025-03-04 09:44:42,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:42,765 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 175 flow [2025-03-04 09:44:42,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-04 09:44:42,765 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-04 09:44:42,766 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 175 flow [2025-03-04 09:44:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-04 09:44:42,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:42,766 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:42,772 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-04 09:44:42,970 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-04 09:44:42,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:42,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -944800005, now seen corresponding path program 2 times [2025-03-04 09:44:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-03-04 09:44:42,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:42,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:42,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:42,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:42,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-03-04 09:44:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794694622] [2025-03-04 09:44:43,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:43,124 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-04 09:44:43,126 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-04 09:44:43,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:43,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:43,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:43,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794694622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318103789] [2025-03-04 09:44:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:43,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:43,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:43,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 09:44:43,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 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-04 09:44:43,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:43,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 09:44:43,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,473 INFO L124 PetriNetUnfolderBase]: 451/1055 cut-off events. [2025-03-04 09:44:43,473 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 09:44:43,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1055 events. 451/1055 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6207 event pairs, 376 based on Foata normal form. 1/987 useless extension candidates. Maximal degree in co-relation 1821. Up to 708 conditions per place. [2025-03-04 09:44:43,481 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 26 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2025-03-04 09:44:43,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 245 flow [2025-03-04 09:44:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2025-03-04 09:44:43,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5100806451612904 [2025-03-04 09:44:43,483 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 175 flow. Second operand 8 states and 253 transitions. [2025-03-04 09:44:43,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 245 flow [2025-03-04 09:44:43,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 219 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:43,485 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 167 flow [2025-03-04 09:44:43,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-04 09:44:43,486 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-03-04 09:44:43,486 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 167 flow [2025-03-04 09:44:43,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 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-04 09:44:43,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:43,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:43,498 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-04 09:44:43,690 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-04 09:44:43,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -928348604, now seen corresponding path program 1 times [2025-03-04 09:44:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607944916] [2025-03-04 09:44:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:43,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607944916] [2025-03-04 09:44:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607944916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116724167] [2025-03-04 09:44:43,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:43,751 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-04 09:44:43,752 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-04 09:44:43,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:43,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:43,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:43,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116724167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:43,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609217854] [2025-03-04 09:44:43,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:43,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:43,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:43,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 62 [2025-03-04 09:44:43,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-04 09:44:43,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:43,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 62 [2025-03-04 09:44:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:44,023 INFO L124 PetriNetUnfolderBase]: 449/1056 cut-off events. [2025-03-04 09:44:44,024 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 09:44:44,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 1056 events. 449/1056 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6208 event pairs, 376 based on Foata normal form. 4/991 useless extension candidates. Maximal degree in co-relation 1827. Up to 707 conditions per place. [2025-03-04 09:44:44,034 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 29 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2025-03-04 09:44:44,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 258 flow [2025-03-04 09:44:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2025-03-04 09:44:44,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2025-03-04 09:44:44,036 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 167 flow. Second operand 8 states and 265 transitions. [2025-03-04 09:44:44,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 258 flow [2025-03-04 09:44:44,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 240 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:44,039 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 179 flow [2025-03-04 09:44:44,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-03-04 09:44:44,040 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-04 09:44:44,041 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 179 flow [2025-03-04 09:44:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-04 09:44:44,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,041 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:44:44,241 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-04 09:44:44,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:44,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1306267432, now seen corresponding path program 2 times [2025-03-04 09:44:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-03-04 09:44:44,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:44,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 09:44:44,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:44,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-03-04 09:44:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445968057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300140358] [2025-03-04 09:44:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:44,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:44,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:44,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-03-04 09:44:44,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-03-04 09:44:44,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:44,629 INFO L124 PetriNetUnfolderBase]: 635/1658 cut-off events. [2025-03-04 09:44:44,630 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 09:44:44,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1658 events. 635/1658 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11582 event pairs, 421 based on Foata normal form. 30/1595 useless extension candidates. Maximal degree in co-relation 2759. Up to 797 conditions per place. [2025-03-04 09:44:44,639 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 56 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-04 09:44:44,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 363 flow [2025-03-04 09:44:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2025-03-04 09:44:44,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:44:44,641 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 179 flow. Second operand 5 states and 186 transitions. [2025-03-04 09:44:44,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 363 flow [2025-03-04 09:44:44,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:44:44,645 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 198 flow [2025-03-04 09:44:44,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-04 09:44:44,647 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 09:44:44,647 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 198 flow [2025-03-04 09:44:44,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,648 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:44:44,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1416188412, now seen corresponding path program 1 times [2025-03-04 09:44:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964544930] [2025-03-04 09:44:44,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:44,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:44,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:44,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:44,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:44,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:44,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:44,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:44,691 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:44,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 09:44:44,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-04 09:44:44,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-04 09:44:44,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-04 09:44:44,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:44:44,692 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 09:44:44,693 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:44,693 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:44:44,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 87 transitions, 192 flow [2025-03-04 09:44:44,725 INFO L124 PetriNetUnfolderBase]: 13/101 cut-off events. [2025-03-04 09:44:44,725 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:44:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 101 events. 13/101 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 348 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2025-03-04 09:44:44,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 87 transitions, 192 flow [2025-03-04 09:44:44,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 87 transitions, 192 flow [2025-03-04 09:44:44,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:44,727 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;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:44,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 09:44:44,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:44,729 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:44,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:44,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:44,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash 402317, now seen corresponding path program 1 times [2025-03-04 09:44:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-03-04 09:44:44,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:44,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:44,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:44,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:44,767 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-04 09:44:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-03-04 09:44:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329211153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627480167] [2025-03-04 09:44:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:44,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:44,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:44,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-03-04 09:44:44,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-04 09:44:44,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-03-04 09:44:44,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:45,496 INFO L124 PetriNetUnfolderBase]: 6456/11566 cut-off events. [2025-03-04 09:44:45,497 INFO L125 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2025-03-04 09:44:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20732 conditions, 11566 events. 6456/11566 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 89052 event pairs, 5560 based on Foata normal form. 2441/13350 useless extension candidates. Maximal degree in co-relation 2145. Up to 8808 conditions per place. [2025-03-04 09:44:45,557 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 35 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2025-03-04 09:44:45,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 232 flow [2025-03-04 09:44:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 09:44:45,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5938697318007663 [2025-03-04 09:44:45,558 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 192 flow. Second operand 3 states and 155 transitions. [2025-03-04 09:44:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 232 flow [2025-03-04 09:44:45,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:45,560 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 160 flow [2025-03-04 09:44:45,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2025-03-04 09:44:45,561 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2025-03-04 09:44:45,561 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 160 flow [2025-03-04 09:44:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-04 09:44:45,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:45,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:45,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:44:45,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:45,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:45,562 INFO L85 PathProgramCache]: Analyzing trace with hash 402318, now seen corresponding path program 1 times [2025-03-04 09:44:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-03-04 09:44:45,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:45,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:45,592 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-04 09:44:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:45,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-03-04 09:44:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135552801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:45,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788264504] [2025-03-04 09:44:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:45,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:45,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:45,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:45,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-04 09:44:45,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:45,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-04 09:44:45,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:46,222 INFO L124 PetriNetUnfolderBase]: 6456/11568 cut-off events. [2025-03-04 09:44:46,223 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-04 09:44:46,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20658 conditions, 11568 events. 6456/11568 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 89102 event pairs, 5560 based on Foata normal form. 0/10910 useless extension candidates. Maximal degree in co-relation 20649. Up to 8810 conditions per place. [2025-03-04 09:44:46,284 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 37 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-04 09:44:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 73 transitions, 242 flow [2025-03-04 09:44:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2025-03-04 09:44:46,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053639846743295 [2025-03-04 09:44:46,286 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 160 flow. Second operand 3 states and 158 transitions. [2025-03-04 09:44:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 73 transitions, 242 flow [2025-03-04 09:44:46,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:46,289 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 173 flow [2025-03-04 09:44:46,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2025-03-04 09:44:46,289 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -6 predicate places. [2025-03-04 09:44:46,290 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 173 flow [2025-03-04 09:44:46,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:46,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:46,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:46,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:44:46,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:46,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 386640711, now seen corresponding path program 1 times [2025-03-04 09:44:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757063559] [2025-03-04 09:44:46,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:46,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:46,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:46,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:46,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757063559] [2025-03-04 09:44:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757063559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808085399] [2025-03-04 09:44:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:46,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:46,341 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-04 09:44:46,343 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-04 09:44:46,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:46,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:46,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:46,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808085399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:46,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954689060] [2025-03-04 09:44:46,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:46,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:46,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:46,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:46,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-04 09:44:46,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-04 09:44:46,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:46,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-04 09:44:46,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:47,391 INFO L124 PetriNetUnfolderBase]: 6458/11576 cut-off events. [2025-03-04 09:44:47,391 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-04 09:44:47,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20686 conditions, 11576 events. 6458/11576 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 89080 event pairs, 5560 based on Foata normal form. 1/10920 useless extension candidates. Maximal degree in co-relation 20675. Up to 8812 conditions per place. [2025-03-04 09:44:47,467 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 40 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-03-04 09:44:47,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 295 flow [2025-03-04 09:44:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-03-04 09:44:47,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-03-04 09:44:47,469 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 173 flow. Second operand 6 states and 285 transitions. [2025-03-04 09:44:47,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 295 flow [2025-03-04 09:44:47,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:47,558 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 223 flow [2025-03-04 09:44:47,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-04 09:44:47,559 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2025-03-04 09:44:47,559 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 223 flow [2025-03-04 09:44:47,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-04 09:44:47,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:47,559 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:47,565 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-04 09:44:47,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:47,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:47,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1429453582, now seen corresponding path program 2 times [2025-03-04 09:44:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771846865] [2025-03-04 09:44:47,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:47,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:47,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:47,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:47,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771846865] [2025-03-04 09:44:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771846865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680228353] [2025-03-04 09:44:47,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:47,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:47,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:47,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:47,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:44:47,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:47,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:47,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:47,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:47,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:48,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680228353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523627420] [2025-03-04 09:44:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:48,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:48,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:48,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-04 09:44:48,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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-04 09:44:48,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:48,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-04 09:44:48,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:48,785 INFO L124 PetriNetUnfolderBase]: 6458/11575 cut-off events. [2025-03-04 09:44:48,786 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2025-03-04 09:44:48,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20699 conditions, 11575 events. 6458/11575 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 89035 event pairs, 5560 based on Foata normal form. 1/10920 useless extension candidates. Maximal degree in co-relation 20684. Up to 8808 conditions per place. [2025-03-04 09:44:48,846 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 36 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-04 09:44:48,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 313 flow [2025-03-04 09:44:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2025-03-04 09:44:48,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5158045977011494 [2025-03-04 09:44:48,852 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 223 flow. Second operand 8 states and 359 transitions. [2025-03-04 09:44:48,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 313 flow [2025-03-04 09:44:48,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 287 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:48,854 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 215 flow [2025-03-04 09:44:48,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-03-04 09:44:48,854 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2025-03-04 09:44:48,854 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 215 flow [2025-03-04 09:44:48,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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-04 09:44:48,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:48,854 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:48,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:49,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:44:49,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1412287197, now seen corresponding path program 1 times [2025-03-04 09:44:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116254711] [2025-03-04 09:44:49,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:49,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:49,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:49,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:49,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:49,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116254711] [2025-03-04 09:44:49,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116254711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:49,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523498197] [2025-03-04 09:44:49,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:49,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:49,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:49,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:44:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:49,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:49,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:49,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:49,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:49,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:49,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523498197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:49,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321130866] [2025-03-04 09:44:49,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:49,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:49,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:49,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-03-04 09:44:49,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 215 flow. Second operand has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-04 09:44:49,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:49,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-03-04 09:44:49,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:49,809 INFO L124 PetriNetUnfolderBase]: 6456/11576 cut-off events. [2025-03-04 09:44:49,810 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2025-03-04 09:44:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20703 conditions, 11576 events. 6456/11576 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 89082 event pairs, 5560 based on Foata normal form. 4/10924 useless extension candidates. Maximal degree in co-relation 20690. Up to 8807 conditions per place. [2025-03-04 09:44:49,871 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 39 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2025-03-04 09:44:49,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 326 flow [2025-03-04 09:44:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 371 transitions. [2025-03-04 09:44:49,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5330459770114943 [2025-03-04 09:44:49,873 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 215 flow. Second operand 8 states and 371 transitions. [2025-03-04 09:44:49,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 326 flow [2025-03-04 09:44:49,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 308 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:49,874 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 227 flow [2025-03-04 09:44:49,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2025-03-04 09:44:49,875 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2025-03-04 09:44:49,875 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 227 flow [2025-03-04 09:44:49,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-04 09:44:49,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:49,875 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:49,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:44:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 09:44:50,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:50,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash -308104569, now seen corresponding path program 2 times [2025-03-04 09:44:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253686358] [2025-03-04 09:44:50,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:50,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:50,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 09:44:50,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:50,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253686358] [2025-03-04 09:44:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253686358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889382153] [2025-03-04 09:44:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:50,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:50,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-04 09:44:50,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-04 09:44:50,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:50,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-04 09:44:50,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:51,537 INFO L124 PetriNetUnfolderBase]: 9236/18484 cut-off events. [2025-03-04 09:44:51,537 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2025-03-04 09:44:51,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 18484 events. 9236/18484 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 169842 event pairs, 6208 based on Foata normal form. 273/17739 useless extension candidates. Maximal degree in co-relation 31636. Up to 9797 conditions per place. [2025-03-04 09:44:51,658 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 86 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-04 09:44:51,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 521 flow [2025-03-04 09:44:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-03-04 09:44:51,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2025-03-04 09:44:51,660 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 227 flow. Second operand 5 states and 276 transitions. [2025-03-04 09:44:51,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 521 flow [2025-03-04 09:44:51,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:44:51,663 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 246 flow [2025-03-04 09:44:51,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-04 09:44:51,663 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2025-03-04 09:44:51,663 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 246 flow [2025-03-04 09:44:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-04 09:44:51,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:51,664 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:51,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:44:51,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1590414797, now seen corresponding path program 1 times [2025-03-04 09:44:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-03-04 09:44:51,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:51,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:51,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:51,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-03-04 09:44:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958048392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165539319] [2025-03-04 09:44:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:51,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:51,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:51,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-04 09:44:51,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-04 09:44:51,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:51,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-04 09:44:51,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:52,971 INFO L124 PetriNetUnfolderBase]: 11243/22420 cut-off events. [2025-03-04 09:44:52,972 INFO L125 PetriNetUnfolderBase]: For 4788/4788 co-relation queries the response was YES. [2025-03-04 09:44:53,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41623 conditions, 22420 events. 11243/22420 cut-off events. For 4788/4788 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 209459 event pairs, 7651 based on Foata normal form. 330/21615 useless extension candidates. Maximal degree in co-relation 41605. Up to 11963 conditions per place. [2025-03-04 09:44:53,255 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 90 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-03-04 09:44:53,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 127 transitions, 574 flow [2025-03-04 09:44:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2025-03-04 09:44:53,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6298850574712643 [2025-03-04 09:44:53,256 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 246 flow. Second operand 5 states and 274 transitions. [2025-03-04 09:44:53,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 127 transitions, 574 flow [2025-03-04 09:44:53,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:53,260 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 272 flow [2025-03-04 09:44:53,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-03-04 09:44:53,260 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 14 predicate places. [2025-03-04 09:44:53,260 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 272 flow [2025-03-04 09:44:53,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-04 09:44:53,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:53,261 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:53,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:44:53,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash -397658883, now seen corresponding path program 1 times [2025-03-04 09:44:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:53,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392123391] [2025-03-04 09:44:53,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:53,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:53,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392123391] [2025-03-04 09:44:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392123391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361337861] [2025-03-04 09:44:53,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:53,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:53,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:53,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:44:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:53,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:53,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 09:44:53,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:53,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361337861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:53,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 09:44:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139039069] [2025-03-04 09:44:53,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:53,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:44:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:44:53,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:44:53,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-04 09:44:53,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 272 flow. Second operand has 11 states, 11 states have (on average 40.72727272727273) internal successors, (448), 11 states have internal predecessors, (448), 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-04 09:44:53,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:53,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-04 09:44:53,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:56,181 INFO L124 PetriNetUnfolderBase]: 18461/36621 cut-off events. [2025-03-04 09:44:56,181 INFO L125 PetriNetUnfolderBase]: For 11312/11312 co-relation queries the response was YES. [2025-03-04 09:44:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72708 conditions, 36621 events. 18461/36621 cut-off events. For 11312/11312 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 363416 event pairs, 6904 based on Foata normal form. 333/35566 useless extension candidates. Maximal degree in co-relation 72687. Up to 12290 conditions per place. [2025-03-04 09:44:56,382 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 123 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-04 09:44:56,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 162 transitions, 780 flow [2025-03-04 09:44:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-03-04 09:44:56,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590038314176245 [2025-03-04 09:44:56,383 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 272 flow. Second operand 6 states and 344 transitions. [2025-03-04 09:44:56,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 162 transitions, 780 flow [2025-03-04 09:44:56,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 162 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:56,392 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 312 flow [2025-03-04 09:44:56,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2025-03-04 09:44:56,393 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 20 predicate places. [2025-03-04 09:44:56,393 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 312 flow [2025-03-04 09:44:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 40.72727272727273) internal successors, (448), 11 states have internal predecessors, (448), 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-04 09:44:56,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:56,393 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:56,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 09:44:56,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 09:44:56,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:56,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash 557456079, now seen corresponding path program 1 times [2025-03-04 09:44:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519997381] [2025-03-04 09:44:56,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:44:56,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:44:56,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:56,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519997381] [2025-03-04 09:44:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519997381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:56,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772840354] [2025-03-04 09:44:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:56,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:56,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:56,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:56,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-04 09:44:56,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-04 09:44:56,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:56,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-04 09:44:56,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:58,837 INFO L124 PetriNetUnfolderBase]: 15860/29655 cut-off events. [2025-03-04 09:44:58,837 INFO L125 PetriNetUnfolderBase]: For 12428/12428 co-relation queries the response was YES. [2025-03-04 09:44:58,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65598 conditions, 29655 events. 15860/29655 cut-off events. For 12428/12428 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 269326 event pairs, 2062 based on Foata normal form. 999/29771 useless extension candidates. Maximal degree in co-relation 65574. Up to 18243 conditions per place. [2025-03-04 09:44:58,986 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 71 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-04 09:44:58,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 532 flow [2025-03-04 09:44:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-04 09:44:58,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-03-04 09:44:58,987 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 312 flow. Second operand 3 states and 177 transitions. [2025-03-04 09:44:58,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 532 flow [2025-03-04 09:44:59,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 107 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:59,027 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 313 flow [2025-03-04 09:44:59,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-03-04 09:44:59,027 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 20 predicate places. [2025-03-04 09:44:59,027 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 313 flow [2025-03-04 09:44:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-04 09:44:59,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:59,028 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:44:59,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 129667583, now seen corresponding path program 1 times [2025-03-04 09:44:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634376769] [2025-03-04 09:44:59,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:44:59,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:44:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:59,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:59,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:44:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:44:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:59,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:59,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:59,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-04 09:44:59,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-04 09:44:59,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:44:59,051 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:59,051 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:59,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:44:59,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:59,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 112 transitions, 252 flow [2025-03-04 09:44:59,077 INFO L124 PetriNetUnfolderBase]: 17/131 cut-off events. [2025-03-04 09:44:59,077 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:44:59,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 131 events. 17/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 495 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 109. Up to 5 conditions per place. [2025-03-04 09:44:59,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 112 transitions, 252 flow [2025-03-04 09:44:59,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 112 transitions, 252 flow [2025-03-04 09:44:59,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:59,079 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;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:59,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 09:44:59,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:59,080 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:59,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:59,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:59,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:59,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-04 09:44:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 513533, now seen corresponding path program 1 times [2025-03-04 09:44:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-03-04 09:44:59,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:59,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:59,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:59,097 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-04 09:44:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-03-04 09:44:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890939036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583245726] [2025-03-04 09:44:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:59,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:59,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:59,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 112 [2025-03-04 09:44:59,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:59,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:59,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 112 [2025-03-04 09:44:59,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:06,447 INFO L124 PetriNetUnfolderBase]: 80126/124925 cut-off events. [2025-03-04 09:45:06,447 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-03-04 09:45:06,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230320 conditions, 124925 events. 80126/124925 cut-off events. For 9197/9197 co-relation queries the response was YES. Maximal size of possible extension queue 3751. Compared 1088627 event pairs, 69712 based on Foata normal form. 31555/150628 useless extension candidates. Maximal degree in co-relation 20819. Up to 101391 conditions per place. [2025-03-04 09:45:07,191 INFO L140 encePairwiseOnDemand]: 97/112 looper letters, 45 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2025-03-04 09:45:07,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 304 flow [2025-03-04 09:45:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-04 09:45:07,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-04 09:45:07,193 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 252 flow. Second operand 3 states and 201 transitions. [2025-03-04 09:45:07,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 304 flow [2025-03-04 09:45:07,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 298 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:07,201 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 208 flow [2025-03-04 09:45:07,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-03-04 09:45:07,206 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2025-03-04 09:45:07,206 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 208 flow [2025-03-04 09:45:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:07,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:07,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:45:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 09:45:07,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-04 09:45:07,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 513534, now seen corresponding path program 1 times [2025-03-04 09:45:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-04 09:45:07,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:45:07,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:45:07,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:07,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:07,236 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-04 09:45:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-04 09:45:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893988722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:45:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286590249] [2025-03-04 09:45:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:07,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:07,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-03-04 09:45:07,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-04 09:45:07,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:07,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-03-04 09:45:07,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:14,714 INFO L124 PetriNetUnfolderBase]: 80126/124927 cut-off events. [2025-03-04 09:45:14,714 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-03-04 09:45:15,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228788 conditions, 124927 events. 80126/124927 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 3751. Compared 1088804 event pairs, 69712 based on Foata normal form. 0/119074 useless extension candidates. Maximal degree in co-relation 228778. Up to 101393 conditions per place. [2025-03-04 09:45:15,754 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-04 09:45:15,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 310 flow [2025-03-04 09:45:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2025-03-04 09:45:15,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-04 09:45:15,755 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 208 flow. Second operand 3 states and 204 transitions. [2025-03-04 09:45:15,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 310 flow [2025-03-04 09:45:15,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:15,766 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 221 flow [2025-03-04 09:45:15,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-04 09:45:15,766 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -8 predicate places. [2025-03-04 09:45:15,766 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 221 flow [2025-03-04 09:45:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-04 09:45:15,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:15,766 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:45:15,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:45:15,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-04 09:45:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 493522871, now seen corresponding path program 1 times [2025-03-04 09:45:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-04 09:45:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:15,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:15,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:15,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:15,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-04 09:45:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122397617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:45:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381249167] [2025-03-04 09:45:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:15,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:45:15,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 09:45:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:15,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:15,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:15,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:15,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:45:15,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:45:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:15,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:45:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381249167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:45:15,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:45:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:45:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689204249] [2025-03-04 09:45:15,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:45:15,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:45:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:15,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:45:15,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:45:16,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-03-04 09:45:16,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 52.875) internal successors, (423), 8 states have internal predecessors, (423), 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-04 09:45:16,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:16,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-03-04 09:45:16,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand