./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:19,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:19,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:19,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:19,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:19,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:19,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:19,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:19,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:19,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:19,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:19,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:19,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:19,338 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:19,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:19,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:19,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:19,339 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2025-03-04 10:18:19,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:19,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:19,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:19,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:19,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:19,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-04 10:18:20,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee60bad8/55ee8372a4894ebb9b104e7c5cb42130/FLAG5e3c504f5 [2025-03-04 10:18:21,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:21,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-04 10:18:21,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee60bad8/55ee8372a4894ebb9b104e7c5cb42130/FLAG5e3c504f5 [2025-03-04 10:18:21,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee60bad8/55ee8372a4894ebb9b104e7c5cb42130 [2025-03-04 10:18:21,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:21,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:21,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:21,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:21,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:21,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75328cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21, skipping insertion in model container [2025-03-04 10:18:21,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:21,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:21,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:21,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:21,729 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:21,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21 WrapperNode [2025-03-04 10:18:21,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:21,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:21,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:21,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:21,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,757 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-03-04 10:18:21,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:21,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:21,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:21,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:21,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,777 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-04 10:18:21,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:21,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:21,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:21,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:21,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (1/1) ... [2025-03-04 10:18:21,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:21,825 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 10:18:21,827 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 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 10:18:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 10:18:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:18:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:18:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:21,845 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 10:18:21,946 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:21,947 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:22,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-03-04 10:18:22,150 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:22,151 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:22,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:22,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:22,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:22 BoogieIcfgContainer [2025-03-04 10:18:22,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:22,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:22,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:22,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:22,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:21" (1/3) ... [2025-03-04 10:18:22,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbc25c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:22, skipping insertion in model container [2025-03-04 10:18:22,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:21" (2/3) ... [2025-03-04 10:18:22,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbc25c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:22, skipping insertion in model container [2025-03-04 10:18:22,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:22" (3/3) ... [2025-03-04 10:18:22,297 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-03-04 10:18:22,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:22,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 49 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 10:18:22,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:22,352 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:22,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-03-04 10:18:22,411 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-03-04 10:18:22,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-03-04 10:18:22,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-03-04 10:18:22,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-03-04 10:18:22,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:22,438 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;@2e66800b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:22,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 10:18:22,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:22,448 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-04 10:18:22,448 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:22,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:22,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:22,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1195185285, now seen corresponding path program 1 times [2025-03-04 10:18:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683659357] [2025-03-04 10:18:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:22,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:18:22,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:18:22,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:22,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:22,769 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 10:18:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683659357] [2025-03-04 10:18:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683659357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:22,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980253263] [2025-03-04 10:18:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:22,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:22,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:22,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:22,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 10:18:22,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:22,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:22,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,981 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-03-04 10:18:22,981 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 10:18:22,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 846 events. 435/846 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4438 event pairs, 320 based on Foata normal form. 92/884 useless extension candidates. Maximal degree in co-relation 1494. Up to 691 conditions per place. [2025-03-04 10:18:22,992 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-03-04 10:18:22,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-03-04 10:18:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 10:18:23,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 10:18:23,004 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-03-04 10:18:23,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-03-04 10:18:23,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:23,012 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-03-04 10:18:23,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2025-03-04 10:18:23,019 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-04 10:18:23,019 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-03-04 10:18:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 10:18:23,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:23,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1195185286, now seen corresponding path program 1 times [2025-03-04 10:18:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127264469] [2025-03-04 10:18:23,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:18:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:18:23,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:23,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,281 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 10:18:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127264469] [2025-03-04 10:18:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127264469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171688388] [2025-03-04 10:18:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:23,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:23,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:23,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 10:18:23,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:23,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:23,513 INFO L124 PetriNetUnfolderBase]: 778/1474 cut-off events. [2025-03-04 10:18:23,514 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:23,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1474 events. 778/1474 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7754 event pairs, 264 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 2687. Up to 698 conditions per place. [2025-03-04 10:18:23,526 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-04 10:18:23,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2025-03-04 10:18:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-03-04 10:18:23,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-03-04 10:18:23,530 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2025-03-04 10:18:23,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2025-03-04 10:18:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:23,532 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2025-03-04 10:18:23,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-04 10:18:23,534 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-04 10:18:23,534 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2025-03-04 10:18:23,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 10:18:23,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:23,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 486356770, now seen corresponding path program 1 times [2025-03-04 10:18:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931482707] [2025-03-04 10:18:23,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:18:23,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:18:23,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:23,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,721 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 10:18:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931482707] [2025-03-04 10:18:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931482707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107838321] [2025-03-04 10:18:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:23,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:23,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:23,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 10:18:23,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:23,875 INFO L124 PetriNetUnfolderBase]: 820/1503 cut-off events. [2025-03-04 10:18:23,876 INFO L125 PetriNetUnfolderBase]: For 51/57 co-relation queries the response was YES. [2025-03-04 10:18:23,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1503 events. 820/1503 cut-off events. For 51/57 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7688 event pairs, 607 based on Foata normal form. 0/1402 useless extension candidates. Maximal degree in co-relation 2908. Up to 1276 conditions per place. [2025-03-04 10:18:23,883 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-04 10:18:23,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2025-03-04 10:18:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 10:18:23,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2025-03-04 10:18:23,887 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2025-03-04 10:18:23,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2025-03-04 10:18:23,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:23,888 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2025-03-04 10:18:23,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-04 10:18:23,889 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-04 10:18:23,890 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2025-03-04 10:18:23,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 10:18:23,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:18:23,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 381019039, now seen corresponding path program 1 times [2025-03-04 10:18:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760837003] [2025-03-04 10:18:23,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:23,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:23,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:23,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,928 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 10:18:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760837003] [2025-03-04 10:18:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760837003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001661484] [2025-03-04 10:18:23,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:23,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:23,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:23,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 10:18:23,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:23,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:24,104 INFO L124 PetriNetUnfolderBase]: 1069/1959 cut-off events. [2025-03-04 10:18:24,105 INFO L125 PetriNetUnfolderBase]: For 87/104 co-relation queries the response was YES. [2025-03-04 10:18:24,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 1959 events. 1069/1959 cut-off events. For 87/104 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11310 event pairs, 507 based on Foata normal form. 24/1902 useless extension candidates. Maximal degree in co-relation 3743. Up to 1132 conditions per place. [2025-03-04 10:18:24,112 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-04 10:18:24,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2025-03-04 10:18:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 10:18:24,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:18:24,113 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2025-03-04 10:18:24,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2025-03-04 10:18:24,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:24,115 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2025-03-04 10:18:24,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-03-04 10:18:24,116 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-04 10:18:24,116 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2025-03-04 10:18:24,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 10:18:24,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:24,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:24,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1243234334, now seen corresponding path program 1 times [2025-03-04 10:18:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453147035] [2025-03-04 10:18:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:24,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,170 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 10:18:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453147035] [2025-03-04 10:18:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453147035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162178443] [2025-03-04 10:18:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:24,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:24,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:24,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:24,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 10:18:24,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:24,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:24,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:24,372 INFO L124 PetriNetUnfolderBase]: 1303/2479 cut-off events. [2025-03-04 10:18:24,372 INFO L125 PetriNetUnfolderBase]: For 239/255 co-relation queries the response was YES. [2025-03-04 10:18:24,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 2479 events. 1303/2479 cut-off events. For 239/255 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14348 event pairs, 486 based on Foata normal form. 48/2472 useless extension candidates. Maximal degree in co-relation 4953. Up to 1292 conditions per place. [2025-03-04 10:18:24,384 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 10:18:24,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2025-03-04 10:18:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 10:18:24,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2025-03-04 10:18:24,385 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2025-03-04 10:18:24,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2025-03-04 10:18:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:24,387 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2025-03-04 10:18:24,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-03-04 10:18:24,387 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-03-04 10:18:24,388 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2025-03-04 10:18:24,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 10:18:24,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:24,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:24,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1340709595, now seen corresponding path program 1 times [2025-03-04 10:18:24,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:24,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464289249] [2025-03-04 10:18:24,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:24,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:18:24,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:18:24,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,428 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 10:18:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464289249] [2025-03-04 10:18:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464289249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404335508] [2025-03-04 10:18:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:24,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:24,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:24,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:24,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:24,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 10:18:24,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:24,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:24,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:24,746 INFO L124 PetriNetUnfolderBase]: 2132/4076 cut-off events. [2025-03-04 10:18:24,748 INFO L125 PetriNetUnfolderBase]: For 730/762 co-relation queries the response was YES. [2025-03-04 10:18:24,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8487 conditions, 4076 events. 2132/4076 cut-off events. For 730/762 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26544 event pairs, 977 based on Foata normal form. 69/4034 useless extension candidates. Maximal degree in co-relation 8475. Up to 2078 conditions per place. [2025-03-04 10:18:24,765 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 10:18:24,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2025-03-04 10:18:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-04 10:18:24,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-03-04 10:18:24,766 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2025-03-04 10:18:24,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2025-03-04 10:18:24,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:24,770 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2025-03-04 10:18:24,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-04 10:18:24,772 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-04 10:18:24,772 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2025-03-04 10:18:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 10:18:24,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:18:24,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -859044378, now seen corresponding path program 1 times [2025-03-04 10:18:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262761242] [2025-03-04 10:18:24,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:24,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:24,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262761242] [2025-03-04 10:18:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262761242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434662496] [2025-03-04 10:18:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:24,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:24,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:24,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:24,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:24,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 10:18:24,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:24,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:24,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,079 INFO L124 PetriNetUnfolderBase]: 1676/3241 cut-off events. [2025-03-04 10:18:25,079 INFO L125 PetriNetUnfolderBase]: For 679/685 co-relation queries the response was YES. [2025-03-04 10:18:25,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 3241 events. 1676/3241 cut-off events. For 679/685 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20300 event pairs, 743 based on Foata normal form. 86/3249 useless extension candidates. Maximal degree in co-relation 6984. Up to 1575 conditions per place. [2025-03-04 10:18:25,096 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-03-04 10:18:25,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2025-03-04 10:18:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-04 10:18:25,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2025-03-04 10:18:25,098 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-03-04 10:18:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2025-03-04 10:18:25,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:25,103 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2025-03-04 10:18:25,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-04 10:18:25,103 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-04 10:18:25,103 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2025-03-04 10:18:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 10:18:25,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:18:25,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash 423348884, now seen corresponding path program 1 times [2025-03-04 10:18:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295257053] [2025-03-04 10:18:25,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:25,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,200 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 10:18:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295257053] [2025-03-04 10:18:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295257053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538435159] [2025-03-04 10:18:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:25,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:25,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:25,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 10:18:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:25,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,358 INFO L124 PetriNetUnfolderBase]: 1070/2329 cut-off events. [2025-03-04 10:18:25,358 INFO L125 PetriNetUnfolderBase]: For 780/780 co-relation queries the response was YES. [2025-03-04 10:18:25,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 2329 events. 1070/2329 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14066 event pairs, 335 based on Foata normal form. 126/2418 useless extension candidates. Maximal degree in co-relation 5090. Up to 1144 conditions per place. [2025-03-04 10:18:25,367 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 10:18:25,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2025-03-04 10:18:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 10:18:25,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-03-04 10:18:25,368 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2025-03-04 10:18:25,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2025-03-04 10:18:25,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:25,371 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2025-03-04 10:18:25,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-04 10:18:25,373 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-04 10:18:25,374 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2025-03-04 10:18:25,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 10:18:25,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:18:25,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1602453229, now seen corresponding path program 1 times [2025-03-04 10:18:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005445714] [2025-03-04 10:18:25,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:25,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:25,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:25,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,594 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 10:18:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005445714] [2025-03-04 10:18:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005445714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645987110] [2025-03-04 10:18:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:25,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:25,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:25,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:25,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:25,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 10:18:25,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:25,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:25,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,869 INFO L124 PetriNetUnfolderBase]: 1594/3343 cut-off events. [2025-03-04 10:18:25,869 INFO L125 PetriNetUnfolderBase]: For 1242/1244 co-relation queries the response was YES. [2025-03-04 10:18:25,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7765 conditions, 3343 events. 1594/3343 cut-off events. For 1242/1244 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19543 event pairs, 913 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 7752. Up to 1748 conditions per place. [2025-03-04 10:18:25,881 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 77 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-04 10:18:25,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 461 flow [2025-03-04 10:18:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-04 10:18:25,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-03-04 10:18:25,882 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 4 states and 156 transitions. [2025-03-04 10:18:25,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 461 flow [2025-03-04 10:18:25,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:25,885 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 159 flow [2025-03-04 10:18:25,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-03-04 10:18:25,886 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-04 10:18:25,886 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 159 flow [2025-03-04 10:18:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 10:18:25,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:18:25,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1130967520, now seen corresponding path program 1 times [2025-03-04 10:18:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756869415] [2025-03-04 10:18:25,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:25,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:25,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,993 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 10:18:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756869415] [2025-03-04 10:18:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756869415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856619974] [2025-03-04 10:18:25,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:25,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:25,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:26,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:26,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 10:18:26,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:26,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,206 INFO L124 PetriNetUnfolderBase]: 1237/2629 cut-off events. [2025-03-04 10:18:26,206 INFO L125 PetriNetUnfolderBase]: For 958/964 co-relation queries the response was YES. [2025-03-04 10:18:26,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 2629 events. 1237/2629 cut-off events. For 958/964 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14431 event pairs, 516 based on Foata normal form. 28/2589 useless extension candidates. Maximal degree in co-relation 5955. Up to 1667 conditions per place. [2025-03-04 10:18:26,219 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-03-04 10:18:26,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 318 flow [2025-03-04 10:18:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-04 10:18:26,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2025-03-04 10:18:26,220 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 159 flow. Second operand 3 states and 109 transitions. [2025-03-04 10:18:26,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 318 flow [2025-03-04 10:18:26,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:26,225 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2025-03-04 10:18:26,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-03-04 10:18:26,226 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-03-04 10:18:26,228 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2025-03-04 10:18:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 10:18:26,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:18:26,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1398445835, now seen corresponding path program 1 times [2025-03-04 10:18:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23781478] [2025-03-04 10:18:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:26,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:18:26,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:26,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:26,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:26,282 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 10:18:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23781478] [2025-03-04 10:18:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23781478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:26,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661059536] [2025-03-04 10:18:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:26,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:26,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 10:18:26,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:26,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,637 INFO L124 PetriNetUnfolderBase]: 1705/3759 cut-off events. [2025-03-04 10:18:26,638 INFO L125 PetriNetUnfolderBase]: For 1404/1408 co-relation queries the response was YES. [2025-03-04 10:18:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 3759 events. 1705/3759 cut-off events. For 1404/1408 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 23918 event pairs, 650 based on Foata normal form. 104/3757 useless extension candidates. Maximal degree in co-relation 8518. Up to 1740 conditions per place. [2025-03-04 10:18:26,651 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 79 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-04 10:18:26,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 488 flow [2025-03-04 10:18:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 10:18:26,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2025-03-04 10:18:26,653 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 4 states and 159 transitions. [2025-03-04 10:18:26,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 488 flow [2025-03-04 10:18:26,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:26,658 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 173 flow [2025-03-04 10:18:26,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-04 10:18:26,658 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-04 10:18:26,658 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 173 flow [2025-03-04 10:18:26,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 10:18:26,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:26,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:26,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1857606310, now seen corresponding path program 1 times [2025-03-04 10:18:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151615102] [2025-03-04 10:18:26,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:26,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:18:26,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:26,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:26,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:18:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668321453] [2025-03-04 10:18:26,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:26,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:26,695 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 10:18:26,696 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 10:18:26,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:18:26,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:26,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:26,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:26,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:18:26,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:26,956 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 10:18:26,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151615102] [2025-03-04 10:18:26,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:18:26,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668321453] [2025-03-04 10:18:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668321453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:26,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729206946] [2025-03-04 10:18:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:26,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:26,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:26,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:26,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:26,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:27,263 INFO L124 PetriNetUnfolderBase]: 1410/3072 cut-off events. [2025-03-04 10:18:27,264 INFO L125 PetriNetUnfolderBase]: For 1935/1937 co-relation queries the response was YES. [2025-03-04 10:18:27,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7503 conditions, 3072 events. 1410/3072 cut-off events. For 1935/1937 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17876 event pairs, 452 based on Foata normal form. 26/3034 useless extension candidates. Maximal degree in co-relation 7484. Up to 1232 conditions per place. [2025-03-04 10:18:27,275 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 66 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-03-04 10:18:27,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 448 flow [2025-03-04 10:18:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-03-04 10:18:27,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2025-03-04 10:18:27,276 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 173 flow. Second operand 4 states and 144 transitions. [2025-03-04 10:18:27,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 448 flow [2025-03-04 10:18:27,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 434 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:27,279 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 177 flow [2025-03-04 10:18:27,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-03-04 10:18:27,280 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2025-03-04 10:18:27,280 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 177 flow [2025-03-04 10:18:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:27,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:27,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:27,287 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 10:18:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:18:27,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 85652572, now seen corresponding path program 1 times [2025-03-04 10:18:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413031097] [2025-03-04 10:18:27,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:27,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:27,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:27,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:28,183 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 10:18:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413031097] [2025-03-04 10:18:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413031097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:28,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:18:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946887495] [2025-03-04 10:18:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:28,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:28,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:28,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 177 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:28,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:28,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:28,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:29,168 INFO L124 PetriNetUnfolderBase]: 1636/3544 cut-off events. [2025-03-04 10:18:29,168 INFO L125 PetriNetUnfolderBase]: For 2083/2089 co-relation queries the response was YES. [2025-03-04 10:18:29,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8632 conditions, 3544 events. 1636/3544 cut-off events. For 2083/2089 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 21695 event pairs, 536 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 8611. Up to 1859 conditions per place. [2025-03-04 10:18:29,183 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 112 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2025-03-04 10:18:29,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 798 flow [2025-03-04 10:18:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:18:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:18:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 364 transitions. [2025-03-04 10:18:29,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-03-04 10:18:29,185 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 177 flow. Second operand 12 states and 364 transitions. [2025-03-04 10:18:29,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 798 flow [2025-03-04 10:18:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 788 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:29,190 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 313 flow [2025-03-04 10:18:29,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=313, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-03-04 10:18:29,191 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-03-04 10:18:29,191 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 313 flow [2025-03-04 10:18:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:29,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:29,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:29,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:18:29,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1438844360, now seen corresponding path program 2 times [2025-03-04 10:18:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011052623] [2025-03-04 10:18:29,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:29,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:29,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:29,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,634 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 10:18:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:29,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011052623] [2025-03-04 10:18:29,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011052623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:29,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:29,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54058060] [2025-03-04 10:18:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:18:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:29,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:18:29,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:18:29,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:29,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 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 10:18:29,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:29,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:30,339 INFO L124 PetriNetUnfolderBase]: 2085/4468 cut-off events. [2025-03-04 10:18:30,340 INFO L125 PetriNetUnfolderBase]: For 5398/5404 co-relation queries the response was YES. [2025-03-04 10:18:30,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 4468 events. 2085/4468 cut-off events. For 5398/5404 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 29019 event pairs, 646 based on Foata normal form. 0/4398 useless extension candidates. Maximal degree in co-relation 12426. Up to 2334 conditions per place. [2025-03-04 10:18:30,359 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 116 selfloop transitions, 25 changer transitions 0/156 dead transitions. [2025-03-04 10:18:30,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 156 transitions, 1062 flow [2025-03-04 10:18:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:18:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:18:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 319 transitions. [2025-03-04 10:18:30,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 10:18:30,361 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 313 flow. Second operand 10 states and 319 transitions. [2025-03-04 10:18:30,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 156 transitions, 1062 flow [2025-03-04 10:18:30,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 156 transitions, 1040 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:30,375 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 575 flow [2025-03-04 10:18:30,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=575, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-03-04 10:18:30,376 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2025-03-04 10:18:30,376 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 575 flow [2025-03-04 10:18:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 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 10:18:30,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:30,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:30,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:18:30,376 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:30,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash 21656280, now seen corresponding path program 3 times [2025-03-04 10:18:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:30,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031843118] [2025-03-04 10:18:30,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:30,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:30,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:30,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:30,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:30,903 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 10:18:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031843118] [2025-03-04 10:18:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031843118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:18:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367385424] [2025-03-04 10:18:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:30,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:30,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:30,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:31,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:31,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 575 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:31,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:31,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:31,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:31,914 INFO L124 PetriNetUnfolderBase]: 2444/5231 cut-off events. [2025-03-04 10:18:31,915 INFO L125 PetriNetUnfolderBase]: For 10092/10104 co-relation queries the response was YES. [2025-03-04 10:18:31,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15844 conditions, 5231 events. 2444/5231 cut-off events. For 10092/10104 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 35429 event pairs, 722 based on Foata normal form. 0/5149 useless extension candidates. Maximal degree in co-relation 15809. Up to 2963 conditions per place. [2025-03-04 10:18:31,946 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 143 selfloop transitions, 33 changer transitions 0/191 dead transitions. [2025-03-04 10:18:31,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 191 transitions, 1507 flow [2025-03-04 10:18:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:18:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:18:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 403 transitions. [2025-03-04 10:18:31,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 10:18:31,951 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 575 flow. Second operand 13 states and 403 transitions. [2025-03-04 10:18:31,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 191 transitions, 1507 flow [2025-03-04 10:18:31,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1431 flow, removed 38 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:31,984 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 862 flow [2025-03-04 10:18:31,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=862, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-03-04 10:18:31,984 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 61 predicate places. [2025-03-04 10:18:31,985 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 862 flow [2025-03-04 10:18:31,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:31,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:31,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:31,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:18:31,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:31,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1522983608, now seen corresponding path program 4 times [2025-03-04 10:18:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005103866] [2025-03-04 10:18:31,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:31,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:18:32,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:32,018 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:32,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:32,604 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 10:18:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005103866] [2025-03-04 10:18:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005103866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:18:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749427837] [2025-03-04 10:18:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:32,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:32,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:32,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:32,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 862 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:32,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:32,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:32,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:33,824 INFO L124 PetriNetUnfolderBase]: 2752/5862 cut-off events. [2025-03-04 10:18:33,824 INFO L125 PetriNetUnfolderBase]: For 14302/14328 co-relation queries the response was YES. [2025-03-04 10:18:33,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18581 conditions, 5862 events. 2752/5862 cut-off events. For 14302/14328 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40605 event pairs, 481 based on Foata normal form. 16/5806 useless extension candidates. Maximal degree in co-relation 18536. Up to 1802 conditions per place. [2025-03-04 10:18:33,860 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 146 selfloop transitions, 72 changer transitions 0/233 dead transitions. [2025-03-04 10:18:33,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 1924 flow [2025-03-04 10:18:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:18:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:18:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 493 transitions. [2025-03-04 10:18:33,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-03-04 10:18:33,862 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 862 flow. Second operand 16 states and 493 transitions. [2025-03-04 10:18:33,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 1924 flow [2025-03-04 10:18:33,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 233 transitions, 1844 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:33,952 INFO L231 Difference]: Finished difference. Result has 133 places, 122 transitions, 1163 flow [2025-03-04 10:18:33,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1163, PETRI_PLACES=133, PETRI_TRANSITIONS=122} [2025-03-04 10:18:33,955 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2025-03-04 10:18:33,955 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 122 transitions, 1163 flow [2025-03-04 10:18:33,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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 10:18:33,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:33,956 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:18:33,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -361185041, now seen corresponding path program 2 times [2025-03-04 10:18:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:33,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128901988] [2025-03-04 10:18:33,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:33,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:18:33,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-03-04 10:18:33,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:33,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:18:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128901988] [2025-03-04 10:18:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128901988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:33,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304108110] [2025-03-04 10:18:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:33,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:33,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:33,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:33,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 1163 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 10:18:33,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:33,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:33,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:34,483 INFO L124 PetriNetUnfolderBase]: 2754/5838 cut-off events. [2025-03-04 10:18:34,483 INFO L125 PetriNetUnfolderBase]: For 17778/17820 co-relation queries the response was YES. [2025-03-04 10:18:34,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19639 conditions, 5838 events. 2754/5838 cut-off events. For 17778/17820 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 40967 event pairs, 1842 based on Foata normal form. 18/5755 useless extension candidates. Maximal degree in co-relation 19587. Up to 4656 conditions per place. [2025-03-04 10:18:34,512 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 105 selfloop transitions, 1 changer transitions 2/121 dead transitions. [2025-03-04 10:18:34,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 121 transitions, 1375 flow [2025-03-04 10:18:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 10:18:34,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2025-03-04 10:18:34,514 INFO L175 Difference]: Start difference. First operand has 133 places, 122 transitions, 1163 flow. Second operand 3 states and 90 transitions. [2025-03-04 10:18:34,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 121 transitions, 1375 flow [2025-03-04 10:18:34,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 1239 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-03-04 10:18:34,558 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 1022 flow [2025-03-04 10:18:34,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2025-03-04 10:18:34,559 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 76 predicate places. [2025-03-04 10:18:34,559 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 1022 flow [2025-03-04 10:18:34,559 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 10:18:34,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:34,559 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:34,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:18:34,559 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:34,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash -735565878, now seen corresponding path program 1 times [2025-03-04 10:18:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551192564] [2025-03-04 10:18:34,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:34,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:34,589 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 10:18:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:34,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551192564] [2025-03-04 10:18:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551192564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988004136] [2025-03-04 10:18:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:34,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:34,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:34,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:34,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:34,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 10:18:34,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:34,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:34,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:35,034 INFO L124 PetriNetUnfolderBase]: 2706/5522 cut-off events. [2025-03-04 10:18:35,034 INFO L125 PetriNetUnfolderBase]: For 12244/12282 co-relation queries the response was YES. [2025-03-04 10:18:35,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17647 conditions, 5522 events. 2706/5522 cut-off events. For 12244/12282 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 36297 event pairs, 655 based on Foata normal form. 57/5503 useless extension candidates. Maximal degree in co-relation 17598. Up to 3599 conditions per place. [2025-03-04 10:18:35,060 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 111 selfloop transitions, 7 changer transitions 11/141 dead transitions. [2025-03-04 10:18:35,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 141 transitions, 1422 flow [2025-03-04 10:18:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-04 10:18:35,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2025-03-04 10:18:35,061 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 1022 flow. Second operand 3 states and 103 transitions. [2025-03-04 10:18:35,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 141 transitions, 1422 flow [2025-03-04 10:18:35,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1339 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:35,085 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 907 flow [2025-03-04 10:18:35,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-03-04 10:18:35,087 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 74 predicate places. [2025-03-04 10:18:35,087 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 907 flow [2025-03-04 10:18:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 10:18:35,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:35,087 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:35,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:18:35,088 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1357388822, now seen corresponding path program 1 times [2025-03-04 10:18:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775272215] [2025-03-04 10:18:35,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:35,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:35,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:35,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:35,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:18:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412460904] [2025-03-04 10:18:35,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:35,110 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 10:18:35,112 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 10:18:35,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:35,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:35,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:35,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:35,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:35,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:35,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:35,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:18:35,291 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:35,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-04 10:18:35,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-04 10:18:35,301 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 10:18:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:35,494 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:35,537 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:35,537 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:35,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:35 BasicIcfg [2025-03-04 10:18:35,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:35,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:35,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:35,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:35,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:22" (3/4) ... [2025-03-04 10:18:35,547 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:18:35,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:35,548 INFO L158 Benchmark]: Toolchain (without parser) took 14198.42ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 128.4MB in the beginning and 165.3MB in the end (delta: -36.9MB). Peak memory consumption was 265.0MB. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 192.9MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.12ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 108.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.48ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: Boogie Preprocessor took 37.57ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 103.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: IcfgBuilder took 490.05ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 64.4MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 10:18:35,548 INFO L158 Benchmark]: TraceAbstraction took 13253.12ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 64.0MB in the beginning and 165.4MB in the end (delta: -101.4MB). Peak memory consumption was 197.9MB. Max. memory is 16.1GB. [2025-03-04 10:18:35,549 INFO L158 Benchmark]: Witness Printer took 1.98ms. Allocated memory is still 469.8MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:35,549 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 192.9MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.12ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 108.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.48ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.57ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 103.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 490.05ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 64.4MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13253.12ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 64.0MB in the beginning and 165.4MB in the end (delta: -101.4MB). Peak memory consumption was 197.9MB. Max. memory is 16.1GB. * Witness Printer took 1.98ms. Allocated memory is still 469.8MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1148 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1023 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4132 IncrementalHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 6 mSDtfsCounter, 4132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1163occurred in iteration=16, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 467 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:18:35,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:37,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:37,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 10:18:37,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:37,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:37,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:37,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:37,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:37,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:37,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:37,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:37,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:37,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:37,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:37,827 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:37,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:37,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:37,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:37,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:37,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:37,829 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2025-03-04 10:18:38,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:38,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:38,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:38,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:38,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:38,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-04 10:18:39,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9412185/9c5675289e6d482ca89a7b1f9dfbfbd8/FLAGbbed118b1 [2025-03-04 10:18:39,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:39,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-04 10:18:39,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9412185/9c5675289e6d482ca89a7b1f9dfbfbd8/FLAGbbed118b1 [2025-03-04 10:18:40,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9412185/9c5675289e6d482ca89a7b1f9dfbfbd8 [2025-03-04 10:18:40,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:40,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:40,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:40,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:40,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:40,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9d0772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40, skipping insertion in model container [2025-03-04 10:18:40,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:40,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:40,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:40,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:40,427 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:40,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40 WrapperNode [2025-03-04 10:18:40,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:40,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:40,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:40,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:40,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,485 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2025-03-04 10:18:40,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:40,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:40,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:40,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:40,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,523 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-04 10:18:40,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:40,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:40,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:40,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:40,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (1/1) ... [2025-03-04 10:18:40,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:40,575 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 10:18:40,582 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 10:18:40,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 10:18:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 10:18:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 10:18:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 10:18:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 10:18:40,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 10:18:40,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 10:18:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 10:18:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 10:18:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 10:18:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:18:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:40,606 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 10:18:40,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:40,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:41,001 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-03-04 10:18:41,003 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:41,003 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:41,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:41,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:41,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:41 BoogieIcfgContainer [2025-03-04 10:18:41,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:41,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:41,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:41,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:41,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:40" (1/3) ... [2025-03-04 10:18:41,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff615b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:41, skipping insertion in model container [2025-03-04 10:18:41,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:40" (2/3) ... [2025-03-04 10:18:41,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff615b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:41, skipping insertion in model container [2025-03-04 10:18:41,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:41" (3/3) ... [2025-03-04 10:18:41,209 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-03-04 10:18:41,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:41,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 49 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 10:18:41,222 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:41,271 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:41,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-03-04 10:18:41,321 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-03-04 10:18:41,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-03-04 10:18:41,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-03-04 10:18:41,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-03-04 10:18:41,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:41,342 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;@18b0ca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:41,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 10:18:41,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:41,349 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-04 10:18:41,349 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:41,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:41,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:41,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -509700733, now seen corresponding path program 1 times [2025-03-04 10:18:41,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:41,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887434] [2025-03-04 10:18:41,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:41,367 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 10:18:41,369 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 10:18:41,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:18:41,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:18:41,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:41,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:18:41,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:41,579 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 10:18:41,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:41,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887434] [2025-03-04 10:18:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206033049] [2025-03-04 10:18:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:41,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:41,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:41,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:41,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:41,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 10:18:41,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:41,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:41,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:41,825 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-03-04 10:18:41,825 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 10:18:41,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 846 events. 435/846 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4438 event pairs, 320 based on Foata normal form. 92/884 useless extension candidates. Maximal degree in co-relation 1494. Up to 691 conditions per place. [2025-03-04 10:18:41,831 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-03-04 10:18:41,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-03-04 10:18:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 10:18:41,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 10:18:41,848 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-03-04 10:18:41,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-03-04 10:18:41,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:41,860 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-03-04 10:18:41,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2025-03-04 10:18:41,868 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-04 10:18:41,868 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-03-04 10:18:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 10:18:41,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:41,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:41,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:42,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash -509700732, now seen corresponding path program 1 times [2025-03-04 10:18:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939697684] [2025-03-04 10:18:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:42,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:42,074 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 10:18:42,075 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 10:18:42,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:18:42,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:18:42,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:42,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:42,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:18:42,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:42,331 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 10:18:42,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:42,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939697684] [2025-03-04 10:18:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939697684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972913231] [2025-03-04 10:18:42,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:42,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:42,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:42,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:42,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 10:18:42,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:42,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:42,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:42,656 INFO L124 PetriNetUnfolderBase]: 778/1474 cut-off events. [2025-03-04 10:18:42,657 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:18:42,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1474 events. 778/1474 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7754 event pairs, 264 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 2687. Up to 698 conditions per place. [2025-03-04 10:18:42,666 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-04 10:18:42,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2025-03-04 10:18:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-03-04 10:18:42,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-03-04 10:18:42,668 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2025-03-04 10:18:42,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2025-03-04 10:18:42,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:42,671 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2025-03-04 10:18:42,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-04 10:18:42,672 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-04 10:18:42,672 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2025-03-04 10:18:42,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 10:18:42,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:42,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:42,681 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 10:18:42,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:42,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1784732254, now seen corresponding path program 1 times [2025-03-04 10:18:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758180073] [2025-03-04 10:18:42,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:42,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:42,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:42,879 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 10:18:42,884 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 10:18:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:18:42,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:18:42,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:42,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:42,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:18:42,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:43,038 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 10:18:43,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:43,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758180073] [2025-03-04 10:18:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758180073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607850999] [2025-03-04 10:18:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:43,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:43,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:43,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:43,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:43,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:43,369 INFO L124 PetriNetUnfolderBase]: 977/1972 cut-off events. [2025-03-04 10:18:43,369 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-04 10:18:43,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1972 events. 977/1972 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10751 event pairs, 196 based on Foata normal form. 74/1989 useless extension candidates. Maximal degree in co-relation 3664. Up to 626 conditions per place. [2025-03-04 10:18:43,381 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-04 10:18:43,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2025-03-04 10:18:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-04 10:18:43,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2025-03-04 10:18:43,385 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2025-03-04 10:18:43,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2025-03-04 10:18:43,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:43,386 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2025-03-04 10:18:43,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2025-03-04 10:18:43,387 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-04 10:18:43,387 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2025-03-04 10:18:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:43,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:43,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,397 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 10:18:43,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:43,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1303263971, now seen corresponding path program 1 times [2025-03-04 10:18:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778397432] [2025-03-04 10:18:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:43,597 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 10:18:43,597 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 10:18:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:43,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:43,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:43,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:43,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:18:43,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:43,692 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 10:18:43,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:43,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778397432] [2025-03-04 10:18:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778397432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:43,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:43,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104716643] [2025-03-04 10:18:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:43,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:43,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:43,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:43,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 10:18:43,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:43,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:43,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:43,875 INFO L124 PetriNetUnfolderBase]: 982/1958 cut-off events. [2025-03-04 10:18:43,875 INFO L125 PetriNetUnfolderBase]: For 401/421 co-relation queries the response was YES. [2025-03-04 10:18:43,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1958 events. 982/1958 cut-off events. For 401/421 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10953 event pairs, 750 based on Foata normal form. 3/1891 useless extension candidates. Maximal degree in co-relation 3863. Up to 1543 conditions per place. [2025-03-04 10:18:43,884 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 30 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2025-03-04 10:18:43,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 195 flow [2025-03-04 10:18:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 10:18:43,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-03-04 10:18:43,885 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 91 transitions. [2025-03-04 10:18:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 195 flow [2025-03-04 10:18:43,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:43,887 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow [2025-03-04 10:18:43,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-04 10:18:43,888 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-04 10:18:43,888 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow [2025-03-04 10:18:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 10:18:43,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:43,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,896 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 10:18:44,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:44,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:44,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash 570068574, now seen corresponding path program 1 times [2025-03-04 10:18:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054538490] [2025-03-04 10:18:44,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:44,091 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 10:18:44,093 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 10:18:44,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:44,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:44,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:44,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:44,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:18:44,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:44,183 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 10:18:44,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:44,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054538490] [2025-03-04 10:18:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054538490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:44,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145490983] [2025-03-04 10:18:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:44,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:44,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:44,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 10:18:44,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:44,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:44,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:44,436 INFO L124 PetriNetUnfolderBase]: 1101/2176 cut-off events. [2025-03-04 10:18:44,436 INFO L125 PetriNetUnfolderBase]: For 395/427 co-relation queries the response was YES. [2025-03-04 10:18:44,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 2176 events. 1101/2176 cut-off events. For 395/427 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12306 event pairs, 484 based on Foata normal form. 0/2098 useless extension candidates. Maximal degree in co-relation 4294. Up to 1037 conditions per place. [2025-03-04 10:18:44,444 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 46 selfloop transitions, 4 changer transitions 2/66 dead transitions. [2025-03-04 10:18:44,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 284 flow [2025-03-04 10:18:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-04 10:18:44,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-03-04 10:18:44,446 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 110 transitions. [2025-03-04 10:18:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 284 flow [2025-03-04 10:18:44,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:44,449 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 149 flow [2025-03-04 10:18:44,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-04 10:18:44,451 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-04 10:18:44,451 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 149 flow [2025-03-04 10:18:44,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 10:18:44,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:44,452 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:44,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:44,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1732127898, now seen corresponding path program 1 times [2025-03-04 10:18:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744022285] [2025-03-04 10:18:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:44,661 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 10:18:44,662 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 10:18:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:44,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:44,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:44,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:18:44,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:44,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:44,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744022285] [2025-03-04 10:18:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744022285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:44,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:44,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384634870] [2025-03-04 10:18:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:44,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:44,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:44,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:44,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-04 10:18:44,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 10:18:44,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:44,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-04 10:18:44,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:44,978 INFO L124 PetriNetUnfolderBase]: 1020/2022 cut-off events. [2025-03-04 10:18:44,978 INFO L125 PetriNetUnfolderBase]: For 286/298 co-relation queries the response was YES. [2025-03-04 10:18:44,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 2022 events. 1020/2022 cut-off events. For 286/298 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10001 event pairs, 415 based on Foata normal form. 0/1953 useless extension candidates. Maximal degree in co-relation 4009. Up to 1094 conditions per place. [2025-03-04 10:18:44,985 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 41 selfloop transitions, 3 changer transitions 2/61 dead transitions. [2025-03-04 10:18:44,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 267 flow [2025-03-04 10:18:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 10:18:44,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2025-03-04 10:18:44,987 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 149 flow. Second operand 3 states and 105 transitions. [2025-03-04 10:18:44,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 267 flow [2025-03-04 10:18:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:44,990 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 153 flow [2025-03-04 10:18:44,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-04 10:18:44,990 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-04 10:18:44,992 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 153 flow [2025-03-04 10:18:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 10:18:44,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:44,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:45,000 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 10:18:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:45,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 48289940, now seen corresponding path program 1 times [2025-03-04 10:18:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571325943] [2025-03-04 10:18:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:45,201 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 10:18:45,202 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 10:18:45,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:18:45,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:18:45,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:45,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:45,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:18:45,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:45,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 10:18:45,317 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 10:18:45,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:45,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571325943] [2025-03-04 10:18:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571325943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:45,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:45,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546796155] [2025-03-04 10:18:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:45,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:45,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:45,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:45,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 10:18:45,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:45,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:45,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:45,476 INFO L124 PetriNetUnfolderBase]: 663/1504 cut-off events. [2025-03-04 10:18:45,476 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-03-04 10:18:45,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 1504 events. 663/1504 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7122 event pairs, 220 based on Foata normal form. 76/1551 useless extension candidates. Maximal degree in co-relation 2945. Up to 618 conditions per place. [2025-03-04 10:18:45,481 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-04 10:18:45,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 257 flow [2025-03-04 10:18:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 10:18:45,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-03-04 10:18:45,482 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 153 flow. Second operand 3 states and 104 transitions. [2025-03-04 10:18:45,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 257 flow [2025-03-04 10:18:45,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:45,484 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 155 flow [2025-03-04 10:18:45,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-04 10:18:45,484 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-04 10:18:45,484 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 155 flow [2025-03-04 10:18:45,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 10:18:45,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:45,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:45,492 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 10:18:45,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:45,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1177874003, now seen corresponding path program 1 times [2025-03-04 10:18:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734424327] [2025-03-04 10:18:45,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:45,688 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 10:18:45,690 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 10:18:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:45,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:45,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:45,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:45,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:18:45,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:46,032 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 10:18:46,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:46,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734424327] [2025-03-04 10:18:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734424327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:46,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:46,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203852965] [2025-03-04 10:18:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:46,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:46,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:46,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:46,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:46,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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 10:18:46,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:46,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:46,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:46,347 INFO L124 PetriNetUnfolderBase]: 1336/2886 cut-off events. [2025-03-04 10:18:46,347 INFO L125 PetriNetUnfolderBase]: For 637/641 co-relation queries the response was YES. [2025-03-04 10:18:46,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 2886 events. 1336/2886 cut-off events. For 637/641 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 15725 event pairs, 724 based on Foata normal form. 0/2784 useless extension candidates. Maximal degree in co-relation 6035. Up to 1099 conditions per place. [2025-03-04 10:18:46,357 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 78 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-04 10:18:46,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 479 flow [2025-03-04 10:18:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-03-04 10:18:46,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681034482758621 [2025-03-04 10:18:46,359 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 155 flow. Second operand 4 states and 155 transitions. [2025-03-04 10:18:46,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 479 flow [2025-03-04 10:18:46,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:46,362 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-03-04 10:18:46,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-04 10:18:46,362 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-04 10:18:46,363 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-03-04 10:18:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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 10:18:46,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:46,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:46,371 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 10:18:46,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:46,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:46,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1671491468, now seen corresponding path program 1 times [2025-03-04 10:18:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:46,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897074753] [2025-03-04 10:18:46,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:46,569 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 10:18:46,570 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 10:18:46,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:18:46,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:18:46,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:46,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:18:46,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:46,851 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 10:18:46,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:46,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897074753] [2025-03-04 10:18:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897074753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884952622] [2025-03-04 10:18:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:46,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:46,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:46,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:46,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-04 10:18:46,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:46,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:46,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-04 10:18:46,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:47,144 INFO L124 PetriNetUnfolderBase]: 937/2051 cut-off events. [2025-03-04 10:18:47,144 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-03-04 10:18:47,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 2051 events. 937/2051 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 10076 event pairs, 422 based on Foata normal form. 7/2015 useless extension candidates. Maximal degree in co-relation 4162. Up to 1045 conditions per place. [2025-03-04 10:18:47,150 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2025-03-04 10:18:47,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 356 flow [2025-03-04 10:18:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-04 10:18:47,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2025-03-04 10:18:47,152 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 4 states and 142 transitions. [2025-03-04 10:18:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 356 flow [2025-03-04 10:18:47,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:47,156 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 177 flow [2025-03-04 10:18:47,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-04 10:18:47,157 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-04 10:18:47,157 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 177 flow [2025-03-04 10:18:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:47,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:47,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:47,169 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 10:18:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:47,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash -3594672, now seen corresponding path program 1 times [2025-03-04 10:18:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975157826] [2025-03-04 10:18:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:47,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:47,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:47,362 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 10:18:47,363 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 10:18:47,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:47,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:47,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:47,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:47,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 10:18:47,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 10:18:47,913 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 10:18:47,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:47,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975157826] [2025-03-04 10:18:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975157826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839631292] [2025-03-04 10:18:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:48,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:48,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 177 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:48,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:48,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:48,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:48,725 INFO L124 PetriNetUnfolderBase]: 1096/2372 cut-off events. [2025-03-04 10:18:48,726 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2025-03-04 10:18:48,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 2372 events. 1096/2372 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12227 event pairs, 450 based on Foata normal form. 27/2356 useless extension candidates. Maximal degree in co-relation 4920. Up to 1398 conditions per place. [2025-03-04 10:18:48,734 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 81 selfloop transitions, 14 changer transitions 17/127 dead transitions. [2025-03-04 10:18:48,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 621 flow [2025-03-04 10:18:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 322 transitions. [2025-03-04 10:18:48,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5047021943573667 [2025-03-04 10:18:48,740 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 177 flow. Second operand 11 states and 322 transitions. [2025-03-04 10:18:48,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 621 flow [2025-03-04 10:18:48,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 127 transitions, 612 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:48,744 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 289 flow [2025-03-04 10:18:48,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=289, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2025-03-04 10:18:48,745 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-03-04 10:18:48,746 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 289 flow [2025-03-04 10:18:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:48,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:48,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:48,754 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 10:18:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:48,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1497749040, now seen corresponding path program 2 times [2025-03-04 10:18:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847727001] [2025-03-04 10:18:48,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:48,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:48,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:48,949 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 10:18:48,951 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 10:18:49,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:49,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:49,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:49,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:49,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:49,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:49,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 10:18:49,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 10:18:49,432 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 10:18:49,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:49,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847727001] [2025-03-04 10:18:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847727001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345319921] [2025-03-04 10:18:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:49,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:49,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 289 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:49,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:49,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:49,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:50,176 INFO L124 PetriNetUnfolderBase]: 1235/2687 cut-off events. [2025-03-04 10:18:50,177 INFO L125 PetriNetUnfolderBase]: For 2661/2661 co-relation queries the response was YES. [2025-03-04 10:18:50,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 2687 events. 1235/2687 cut-off events. For 2661/2661 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14480 event pairs, 495 based on Foata normal form. 31/2671 useless extension candidates. Maximal degree in co-relation 7258. Up to 1664 conditions per place. [2025-03-04 10:18:50,187 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 89 selfloop transitions, 20 changer transitions 10/134 dead transitions. [2025-03-04 10:18:50,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 843 flow [2025-03-04 10:18:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 320 transitions. [2025-03-04 10:18:50,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5015673981191222 [2025-03-04 10:18:50,190 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 289 flow. Second operand 11 states and 320 transitions. [2025-03-04 10:18:50,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 843 flow [2025-03-04 10:18:50,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 828 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:50,198 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 500 flow [2025-03-04 10:18:50,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=500, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2025-03-04 10:18:50,199 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-03-04 10:18:50,199 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 500 flow [2025-03-04 10:18:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:50,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:50,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:50,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:50,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1922311674, now seen corresponding path program 3 times [2025-03-04 10:18:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170110161] [2025-03-04 10:18:50,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:50,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:50,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:50,403 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:50,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:18:50,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:50,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:50,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:50,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:50,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:50,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 10:18:50,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 10:18:50,827 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 10:18:50,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:50,827 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170110161] [2025-03-04 10:18:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170110161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:50,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338534131] [2025-03-04 10:18:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:50,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:50,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:50,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 500 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:50,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:50,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:51,721 INFO L124 PetriNetUnfolderBase]: 1395/3046 cut-off events. [2025-03-04 10:18:51,721 INFO L125 PetriNetUnfolderBase]: For 6665/6669 co-relation queries the response was YES. [2025-03-04 10:18:51,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 3046 events. 1395/3046 cut-off events. For 6665/6669 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16901 event pairs, 466 based on Foata normal form. 13/3025 useless extension candidates. Maximal degree in co-relation 9330. Up to 1934 conditions per place. [2025-03-04 10:18:51,734 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 108 selfloop transitions, 20 changer transitions 4/147 dead transitions. [2025-03-04 10:18:51,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1088 flow [2025-03-04 10:18:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 317 transitions. [2025-03-04 10:18:51,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49686520376175547 [2025-03-04 10:18:51,736 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 500 flow. Second operand 11 states and 317 transitions. [2025-03-04 10:18:51,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1088 flow [2025-03-04 10:18:51,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 147 transitions, 1014 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:51,749 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 631 flow [2025-03-04 10:18:51,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=631, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2025-03-04 10:18:51,750 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2025-03-04 10:18:51,750 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 631 flow [2025-03-04 10:18:51,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:51,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:51,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:51,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:18:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,951 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1745207160, now seen corresponding path program 4 times [2025-03-04 10:18:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384845809] [2025-03-04 10:18:51,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:51,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:51,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:18:52,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:18:52,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:52,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:52,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:18:52,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 10:18:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 10:18:52,440 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 10:18:52,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:52,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:18:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384845809] [2025-03-04 10:18:52,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384845809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:52,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:52,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:18:52,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164378934] [2025-03-04 10:18:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:52,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:18:52,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:52,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:52,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-04 10:18:52,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 631 flow. Second operand has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:52,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:52,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-04 10:18:52,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:53,363 INFO L124 PetriNetUnfolderBase]: 1539/3346 cut-off events. [2025-03-04 10:18:53,363 INFO L125 PetriNetUnfolderBase]: For 8026/8036 co-relation queries the response was YES. [2025-03-04 10:18:53,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10567 conditions, 3346 events. 1539/3346 cut-off events. For 8026/8036 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 19092 event pairs, 316 based on Foata normal form. 17/3329 useless extension candidates. Maximal degree in co-relation 10526. Up to 1245 conditions per place. [2025-03-04 10:18:53,376 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 97 selfloop transitions, 52 changer transitions 11/175 dead transitions. [2025-03-04 10:18:53,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1341 flow [2025-03-04 10:18:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:18:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:18:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 397 transitions. [2025-03-04 10:18:53,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48891625615763545 [2025-03-04 10:18:53,378 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 631 flow. Second operand 14 states and 397 transitions. [2025-03-04 10:18:53,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1341 flow [2025-03-04 10:18:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 175 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:53,392 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 849 flow [2025-03-04 10:18:53,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=849, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2025-03-04 10:18:53,393 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2025-03-04 10:18:53,393 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 849 flow [2025-03-04 10:18:53,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.7) internal successors, (207), 10 states have internal predecessors, (207), 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 10:18:53,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:53,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:53,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:18:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:53,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 10:18:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -639148054, now seen corresponding path program 1 times [2025-03-04 10:18:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:18:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128068] [2025-03-04 10:18:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:53,597 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:53,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:18:53,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:53,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:53,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:53,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:53,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:18:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:18:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:53,773 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:18:53,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:53,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-04 10:18:53,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-04 10:18:53,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-04 10:18:53,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-04 10:18:53,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-04 10:18:53,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-04 10:18:53,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-04 10:18:53,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:18:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:53,977 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:54,019 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:54,020 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:54,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:54 BasicIcfg [2025-03-04 10:18:54,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:54,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:54,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:54,024 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:54,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:41" (3/4) ... [2025-03-04 10:18:54,025 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:18:54,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:54,027 INFO L158 Benchmark]: Toolchain (without parser) took 13988.20ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 91.3MB in the beginning and 129.8MB in the end (delta: -38.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-04 10:18:54,027 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:54,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.32ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 69.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:18:54,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.92ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 67.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:54,027 INFO L158 Benchmark]: Boogie Preprocessor took 54.48ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:54,027 INFO L158 Benchmark]: IcfgBuilder took 656.79ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 61.8MB in the end (delta: 3.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-04 10:18:54,028 INFO L158 Benchmark]: TraceAbstraction took 12822.58ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.0MB in the beginning and 129.9MB in the end (delta: -68.8MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:54,028 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 226.5MB. Free memory was 129.9MB in the beginning and 129.8MB in the end (delta: 15.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:54,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.32ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 69.5MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.92ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 67.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.48ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 656.79ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 61.8MB in the end (delta: 3.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12822.58ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.0MB in the beginning and 129.9MB in the end (delta: -68.8MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 226.5MB. Free memory was 129.9MB in the beginning and 129.8MB in the end (delta: 15.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3402 IncrementalHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 13 mSDtfsCounter, 3402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=849occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:18:54,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample