./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 14:34:17,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:34:17,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:34:17,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:34:17,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:34:17,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:34:17,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:34:17,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:34:17,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:34:17,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:34:17,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:34:17,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:34:17,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:34:17,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:34:17,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:34:17,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:34:17,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:34:17,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:34:17,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:34:17,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:34:17,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:34:17,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:34:17,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:34:17,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:34:17,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:17,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:34:17,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:34:17,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:34:17,511 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-17 14:34:17,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:34:17,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:34:17,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:34:17,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:34:17,771 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:34:17,772 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-17 14:34:18,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e27482b/0af3e8745aef4af887024383aff114ca/FLAG33fd1cd38 [2025-03-17 14:34:19,219 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:34:19,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-17 14:34:19,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e27482b/0af3e8745aef4af887024383aff114ca/FLAG33fd1cd38 [2025-03-17 14:34:19,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e27482b/0af3e8745aef4af887024383aff114ca [2025-03-17 14:34:19,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:34:19,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:34:19,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:19,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:34:19,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:34:19,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19, skipping insertion in model container [2025-03-17 14:34:19,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:34:19,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:19,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:34:19,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:19,620 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:34:19,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19 WrapperNode [2025-03-17 14:34:19,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:19,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:19,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:34:19,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:34:19,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,655 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-03-17 14:34:19,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:19,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:34:19,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:34:19,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:34:19,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,687 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-17 14:34:19,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:34:19,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:34:19,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:34:19,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:34:19,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:19,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:34:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 14:34:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 14:34:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 14:34:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:34:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:34:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:34:19,766 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:34:19,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:34:19,882 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:34:20,113 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-03-17 14:34:20,114 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:34:20,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:34:20,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:34:20,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:34:20,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:20 BoogieIcfgContainer [2025-03-17 14:34:20,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:34:20,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:34:20,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:34:20,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:34:20,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:34:19" (1/3) ... [2025-03-17 14:34:20,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b85c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:20, skipping insertion in model container [2025-03-17 14:34:20,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19" (2/3) ... [2025-03-17 14:34:20,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b85c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:20, skipping insertion in model container [2025-03-17 14:34:20,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:20" (3/3) ... [2025-03-17 14:34:20,265 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-03-17 14:34:20,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:34:20,278 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-17 14:34:20,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:34:20,349 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:34:20,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-03-17 14:34:20,401 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-03-17 14:34:20,405 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:20,407 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 151 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-17 14:34:20,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-03-17 14:34:20,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-03-17 14:34:20,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:34:20,430 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;@166ac9db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:34:20,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 14:34:20,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:34:20,440 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-17 14:34:20,440 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:20,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:20,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:20,441 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-17 14:34:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 342742276, now seen corresponding path program 1 times [2025-03-17 14:34:20,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897981410] [2025-03-17 14:34:20,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:20,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:20,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:20,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:20,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:20,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897981410] [2025-03-17 14:34:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897981410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:20,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520928212] [2025-03-17 14:34:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:20,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:20,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:20,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:20,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:20,776 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-17 14:34:20,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:20,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:20,963 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-03-17 14:34:20,963 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 14:34:20,967 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 4442 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-17 14:34:20,972 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-03-17 14:34:20,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-03-17 14:34:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-17 14:34:20,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-17 14:34:20,988 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-03-17 14:34:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-03-17 14:34:20,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:34:20,995 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-03-17 14:34:20,998 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-17 14:34:21,000 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-17 14:34:21,001 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-03-17 14:34:21,001 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-17 14:34:21,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:34:21,002 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-17 14:34:21,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 342742277, now seen corresponding path program 1 times [2025-03-17 14:34:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70095627] [2025-03-17 14:34:21,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:21,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:21,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70095627] [2025-03-17 14:34:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70095627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:34:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689204249] [2025-03-17 14:34:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:21,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:21,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2025-03-17 14:34:21,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-17 14:34:21,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2025-03-17 14:34:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:21,430 INFO L124 PetriNetUnfolderBase]: 438/819 cut-off events. [2025-03-17 14:34:21,430 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:34:21,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 819 events. 438/819 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3985 event pairs, 325 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1525. Up to 698 conditions per place. [2025-03-17 14:34:21,435 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-03-17 14:34:21,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 150 flow [2025-03-17 14:34:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-17 14:34:21,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 14:34:21,438 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 87 transitions. [2025-03-17 14:34:21,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 150 flow [2025-03-17 14:34:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:21,440 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 91 flow [2025-03-17 14:34:21,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-03-17 14:34:21,441 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2025-03-17 14:34:21,441 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 91 flow [2025-03-17 14:34:21,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-17 14:34:21,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:34:21,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 14:34:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 962437026, now seen corresponding path program 1 times [2025-03-17 14:34:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-17 14:34:21,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:34:21,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:34:21,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:21,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-17 14:34:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197086812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:34:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321989134] [2025-03-17 14:34:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:21,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:21,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:21,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 91 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-17 14:34:21,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:21,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:21,678 INFO L124 PetriNetUnfolderBase]: 450/899 cut-off events. [2025-03-17 14:34:21,678 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:34:21,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 899 events. 450/899 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4316 event pairs, 181 based on Foata normal form. 16/873 useless extension candidates. Maximal degree in co-relation 1630. Up to 464 conditions per place. [2025-03-17 14:34:21,684 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 42 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-03-17 14:34:21,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 218 flow [2025-03-17 14:34:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-17 14:34:21,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2025-03-17 14:34:21,686 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 91 flow. Second operand 3 states and 109 transitions. [2025-03-17 14:34:21,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 218 flow [2025-03-17 14:34:21,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:21,688 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 105 flow [2025-03-17 14:34:21,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-17 14:34:21,689 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-17 14:34:21,689 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 105 flow [2025-03-17 14:34:21,689 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-17 14:34:21,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:34:21,689 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-17 14:34:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1686361630, now seen corresponding path program 1 times [2025-03-17 14:34:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142232689] [2025-03-17 14:34:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:34:21,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:34:21,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142232689] [2025-03-17 14:34:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142232689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418984429] [2025-03-17 14:34:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:21,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:21,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:21,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 105 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-17 14:34:21,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:21,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:21,895 INFO L124 PetriNetUnfolderBase]: 646/1297 cut-off events. [2025-03-17 14:34:21,895 INFO L125 PetriNetUnfolderBase]: For 113/117 co-relation queries the response was YES. [2025-03-17 14:34:21,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 1297 events. 646/1297 cut-off events. For 113/117 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6728 event pairs, 266 based on Foata normal form. 12/1249 useless extension candidates. Maximal degree in co-relation 2467. Up to 771 conditions per place. [2025-03-17 14:34:21,901 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-17 14:34:21,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 260 flow [2025-03-17 14:34:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-03-17 14:34:21,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2025-03-17 14:34:21,904 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 105 flow. Second operand 3 states and 114 transitions. [2025-03-17 14:34:21,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 260 flow [2025-03-17 14:34:21,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:21,906 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 114 flow [2025-03-17 14:34:21,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-17 14:34:21,907 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-03-17 14:34:21,908 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 114 flow [2025-03-17 14:34:21,908 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-17 14:34:21,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,908 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-17 14:34:21,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:34:21,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 14:34:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1834907774, now seen corresponding path program 1 times [2025-03-17 14:34:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:21,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152691588] [2025-03-17 14:34:21,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:34:21,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:34:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152691588] [2025-03-17 14:34:21,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152691588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:21,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611311485] [2025-03-17 14:34:21,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:21,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:21,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:21,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:21,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 114 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-17 14:34:21,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:21,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,174 INFO L124 PetriNetUnfolderBase]: 1093/2204 cut-off events. [2025-03-17 14:34:22,175 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-03-17 14:34:22,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 2204 events. 1093/2204 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13165 event pairs, 497 based on Foata normal form. 44/2151 useless extension candidates. Maximal degree in co-relation 4398. Up to 1076 conditions per place. [2025-03-17 14:34:22,188 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-17 14:34:22,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 285 flow [2025-03-17 14:34:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-17 14:34:22,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2025-03-17 14:34:22,191 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 114 flow. Second operand 3 states and 113 transitions. [2025-03-17 14:34:22,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 285 flow [2025-03-17 14:34:22,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,193 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 124 flow [2025-03-17 14:34:22,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-17 14:34:22,193 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-03-17 14:34:22,194 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 124 flow [2025-03-17 14:34:22,194 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-17 14:34:22,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,194 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-17 14:34:22,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:34:22,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 14:34:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1185188251, now seen corresponding path program 1 times [2025-03-17 14:34:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326278118] [2025-03-17 14:34:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:34:22,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:34:22,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326278118] [2025-03-17 14:34:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326278118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:22,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755177271] [2025-03-17 14:34:22,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:22,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:22,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:22,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 124 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-17 14:34:22,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,463 INFO L124 PetriNetUnfolderBase]: 651/1500 cut-off events. [2025-03-17 14:34:22,464 INFO L125 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2025-03-17 14:34:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1500 events. 651/1500 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 8431 event pairs, 191 based on Foata normal form. 80/1543 useless extension candidates. Maximal degree in co-relation 3114. Up to 716 conditions per place. [2025-03-17 14:34:22,470 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 39 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-17 14:34:22,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 254 flow [2025-03-17 14:34:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-17 14:34:22,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2025-03-17 14:34:22,472 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 124 flow. Second operand 3 states and 103 transitions. [2025-03-17 14:34:22,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 254 flow [2025-03-17 14:34:22,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,474 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 130 flow [2025-03-17 14:34:22,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-03-17 14:34:22,475 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-03-17 14:34:22,475 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 130 flow [2025-03-17 14:34:22,475 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-17 14:34:22,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,476 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-17 14:34:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:34:22,476 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-17 14:34:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1935194035, now seen corresponding path program 1 times [2025-03-17 14:34:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608662232] [2025-03-17 14:34:22,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:34:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:34:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608662232] [2025-03-17 14:34:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608662232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098753403] [2025-03-17 14:34:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:34:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:34:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:34:22,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:22,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:22,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,015 INFO L124 PetriNetUnfolderBase]: 1308/2842 cut-off events. [2025-03-17 14:34:23,017 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-03-17 14:34:23,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 2842 events. 1308/2842 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 15590 event pairs, 389 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 6327. Up to 829 conditions per place. [2025-03-17 14:34:23,030 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 93 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-03-17 14:34:23,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 535 flow [2025-03-17 14:34:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:34:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:34:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-03-17 14:34:23,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2025-03-17 14:34:23,031 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 130 flow. Second operand 5 states and 184 transitions. [2025-03-17 14:34:23,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 535 flow [2025-03-17 14:34:23,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 519 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:23,037 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 150 flow [2025-03-17 14:34:23,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-17 14:34:23,038 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-03-17 14:34:23,038 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 150 flow [2025-03-17 14:34:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,038 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-17 14:34:23,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:34:23,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 14:34:23,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1256313804, now seen corresponding path program 1 times [2025-03-17 14:34:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-03-17 14:34:23,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:34:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:34:23,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-03-17 14:34:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886602747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:34:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662798246] [2025-03-17 14:34:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:23,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:23,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:23,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 150 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-17 14:34:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,399 INFO L124 PetriNetUnfolderBase]: 1780/3982 cut-off events. [2025-03-17 14:34:23,399 INFO L125 PetriNetUnfolderBase]: For 1362/1362 co-relation queries the response was YES. [2025-03-17 14:34:23,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8835 conditions, 3982 events. 1780/3982 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 25521 event pairs, 689 based on Foata normal form. 104/3969 useless extension candidates. Maximal degree in co-relation 8820. Up to 1843 conditions per place. [2025-03-17 14:34:23,418 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 79 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-17 14:34:23,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 469 flow [2025-03-17 14:34:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-17 14:34:23,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767241379310345 [2025-03-17 14:34:23,419 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 150 flow. Second operand 4 states and 157 transitions. [2025-03-17 14:34:23,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 469 flow [2025-03-17 14:34:23,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:34:23,423 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 166 flow [2025-03-17 14:34:23,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=166, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-03-17 14:34:23,424 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-03-17 14:34:23,424 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 166 flow [2025-03-17 14:34:23,424 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-17 14:34:23,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,424 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-17 14:34:23,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:34:23,427 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-17 14:34:23,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1715474727, now seen corresponding path program 1 times [2025-03-17 14:34:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-03-17 14:34:23,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:34:23,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:34:23,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:34:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514555879] [2025-03-17 14:34:23,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:23,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:23,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:34:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:34:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:34:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:34:23,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:23,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:23,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-03-17 14:34:23,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:34:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514555879] [2025-03-17 14:34:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514555879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:23,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847153449] [2025-03-17 14:34:23,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:23,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:23,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:23,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:23,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:23,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 166 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-17 14:34:23,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:23,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:24,038 INFO L124 PetriNetUnfolderBase]: 1958/4270 cut-off events. [2025-03-17 14:34:24,039 INFO L125 PetriNetUnfolderBase]: For 2612/2612 co-relation queries the response was YES. [2025-03-17 14:34:24,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10286 conditions, 4270 events. 1958/4270 cut-off events. For 2612/2612 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26789 event pairs, 563 based on Foata normal form. 26/4200 useless extension candidates. Maximal degree in co-relation 10269. Up to 2094 conditions per place. [2025-03-17 14:34:24,056 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 71 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-03-17 14:34:24,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 471 flow [2025-03-17 14:34:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-17 14:34:24,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2025-03-17 14:34:24,057 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 166 flow. Second operand 4 states and 148 transitions. [2025-03-17 14:34:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 471 flow [2025-03-17 14:34:24,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 457 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:24,061 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 186 flow [2025-03-17 14:34:24,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=160, 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=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-17 14:34:24,062 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-17 14:34:24,062 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 186 flow [2025-03-17 14:34:24,062 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-17 14:34:24,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:24,062 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-17 14:34:24,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:24,266 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-17 14:34:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash 196764348, now seen corresponding path program 1 times [2025-03-17 14:34:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771378821] [2025-03-17 14:34:24,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:24,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:24,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:24,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:24,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771378821] [2025-03-17 14:34:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771378821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:34:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623067568] [2025-03-17 14:34:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:24,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:24,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:24,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:25,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:25,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 186 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-17 14:34:25,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:25,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:25,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:25,898 INFO L124 PetriNetUnfolderBase]: 2186/4772 cut-off events. [2025-03-17 14:34:25,898 INFO L125 PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES. [2025-03-17 14:34:25,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11475 conditions, 4772 events. 2186/4772 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 31214 event pairs, 683 based on Foata normal form. 0/4675 useless extension candidates. Maximal degree in co-relation 11456. Up to 2778 conditions per place. [2025-03-17 14:34:25,918 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 116 selfloop transitions, 18 changer transitions 0/148 dead transitions. [2025-03-17 14:34:25,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 148 transitions, 826 flow [2025-03-17 14:34:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:34:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:34:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2025-03-17 14:34:25,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2025-03-17 14:34:25,920 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 186 flow. Second operand 12 states and 365 transitions. [2025-03-17 14:34:25,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 148 transitions, 826 flow [2025-03-17 14:34:25,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 813 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:25,926 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 331 flow [2025-03-17 14:34:25,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=331, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-03-17 14:34:25,926 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-03-17 14:34:25,926 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 331 flow [2025-03-17 14:34:25,927 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-17 14:34:25,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:25,927 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-17 14:34:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:34:25,927 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-17 14:34:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1608860816, now seen corresponding path program 2 times [2025-03-17 14:34:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-03-17 14:34:25,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:25,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:25,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:25,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:34:25,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:26,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-03-17 14:34:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087144822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:26,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:34:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056484353] [2025-03-17 14:34:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:26,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:26,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:26,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 331 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-17 14:34:26,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:26,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:26,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:27,334 INFO L124 PetriNetUnfolderBase]: 2505/5405 cut-off events. [2025-03-17 14:34:27,334 INFO L125 PetriNetUnfolderBase]: For 6589/6589 co-relation queries the response was YES. [2025-03-17 14:34:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14800 conditions, 5405 events. 2505/5405 cut-off events. For 6589/6589 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 35994 event pairs, 686 based on Foata normal form. 0/5305 useless extension candidates. Maximal degree in co-relation 14773. Up to 3248 conditions per place. [2025-03-17 14:34:27,356 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 127 selfloop transitions, 26 changer transitions 0/167 dead transitions. [2025-03-17 14:34:27,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 1130 flow [2025-03-17 14:34:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:34:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:34:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 368 transitions. [2025-03-17 14:34:27,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2025-03-17 14:34:27,358 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 331 flow. Second operand 12 states and 368 transitions. [2025-03-17 14:34:27,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 1130 flow [2025-03-17 14:34:27,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 167 transitions, 1109 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:27,370 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 592 flow [2025-03-17 14:34:27,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=592, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2025-03-17 14:34:27,371 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2025-03-17 14:34:27,371 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 592 flow [2025-03-17 14:34:27,371 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-17 14:34:27,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:27,371 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-17 14:34:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:34:27,371 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-17 14:34:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1161828592, now seen corresponding path program 3 times [2025-03-17 14:34:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-03-17 14:34:27,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:34:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:27,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:27,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:27,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:34:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:27,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-03-17 14:34:27,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475941743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:27,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:27,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:34:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038350817] [2025-03-17 14:34:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:27,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:27,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:27,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:27,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:27,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:27,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 592 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-17 14:34:27,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:27,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:27,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:28,736 INFO L124 PetriNetUnfolderBase]: 2732/5898 cut-off events. [2025-03-17 14:34:28,736 INFO L125 PetriNetUnfolderBase]: For 10830/10834 co-relation queries the response was YES. [2025-03-17 14:34:28,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17443 conditions, 5898 events. 2732/5898 cut-off events. For 10830/10834 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 40186 event pairs, 769 based on Foata normal form. 0/5795 useless extension candidates. Maximal degree in co-relation 17408. Up to 3656 conditions per place. [2025-03-17 14:34:28,760 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 138 selfloop transitions, 28 changer transitions 0/180 dead transitions. [2025-03-17 14:34:28,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 180 transitions, 1388 flow [2025-03-17 14:34:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:34:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:34:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 370 transitions. [2025-03-17 14:34:28,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5316091954022989 [2025-03-17 14:34:28,762 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 592 flow. Second operand 12 states and 370 transitions. [2025-03-17 14:34:28,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 180 transitions, 1388 flow [2025-03-17 14:34:28,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 180 transitions, 1318 flow, removed 35 selfloop flow, removed 0 redundant places. [2025-03-17 14:34:28,785 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 794 flow [2025-03-17 14:34:28,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=794, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2025-03-17 14:34:28,786 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 61 predicate places. [2025-03-17 14:34:28,786 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 794 flow [2025-03-17 14:34:28,787 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-17 14:34:28,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:28,787 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-17 14:34:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:34:28,787 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-17 14:34:28,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1634095384, now seen corresponding path program 4 times [2025-03-17 14:34:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687652078] [2025-03-17 14:34:28,788 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:34:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:28,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:34:28,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:28,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:34:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687652078] [2025-03-17 14:34:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687652078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:29,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:29,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:34:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934585380] [2025-03-17 14:34:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:29,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:29,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:29,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:29,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:29,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 794 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-17 14:34:29,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:29,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:29,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:30,548 INFO L124 PetriNetUnfolderBase]: 3045/6541 cut-off events. [2025-03-17 14:34:30,548 INFO L125 PetriNetUnfolderBase]: For 14495/14511 co-relation queries the response was YES. [2025-03-17 14:34:30,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20097 conditions, 6541 events. 3045/6541 cut-off events. For 14495/14511 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 45563 event pairs, 542 based on Foata normal form. 8/6449 useless extension candidates. Maximal degree in co-relation 20053. Up to 2651 conditions per place. [2025-03-17 14:34:30,581 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 148 selfloop transitions, 70 changer transitions 0/232 dead transitions. [2025-03-17 14:34:30,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 232 transitions, 1830 flow [2025-03-17 14:34:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:34:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 14:34:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 496 transitions. [2025-03-17 14:34:30,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-17 14:34:30,584 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 794 flow. Second operand 16 states and 496 transitions. [2025-03-17 14:34:30,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 232 transitions, 1830 flow [2025-03-17 14:34:30,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 232 transitions, 1756 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:30,618 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 1093 flow [2025-03-17 14:34:30,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1093, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2025-03-17 14:34:30,619 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 80 predicate places. [2025-03-17 14:34:30,619 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 1093 flow [2025-03-17 14:34:30,619 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-17 14:34:30,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:30,619 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-17 14:34:30,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:34:30,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 14:34:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2012168050, now seen corresponding path program 2 times [2025-03-17 14:34:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215443854] [2025-03-17 14:34:30,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:30,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:34:30,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-03-17 14:34:30,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:34:30,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:30,644 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-17 14:34:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215443854] [2025-03-17 14:34:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215443854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000964] [2025-03-17 14:34:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:30,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:30,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:30,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 1093 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-17 14:34:30,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:30,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:30,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:31,188 INFO L124 PetriNetUnfolderBase]: 3051/6514 cut-off events. [2025-03-17 14:34:31,188 INFO L125 PetriNetUnfolderBase]: For 18580/18592 co-relation queries the response was YES. [2025-03-17 14:34:31,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21254 conditions, 6514 events. 3051/6514 cut-off events. For 18580/18592 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 45659 event pairs, 2021 based on Foata normal form. 10/6401 useless extension candidates. Maximal degree in co-relation 21204. Up to 5135 conditions per place. [2025-03-17 14:34:31,222 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 102 selfloop transitions, 1 changer transitions 2/117 dead transitions. [2025-03-17 14:34:31,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 117 transitions, 1299 flow [2025-03-17 14:34:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 14:34:31,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2025-03-17 14:34:31,224 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 1093 flow. Second operand 3 states and 89 transitions. [2025-03-17 14:34:31,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 117 transitions, 1299 flow [2025-03-17 14:34:31,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 1081 flow, removed 53 selfloop flow, removed 13 redundant places. [2025-03-17 14:34:31,278 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 870 flow [2025-03-17 14:34:31,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-03-17 14:34:31,279 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2025-03-17 14:34:31,279 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 870 flow [2025-03-17 14:34:31,279 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-17 14:34:31,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:31,279 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-17 14:34:31,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:34:31,280 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-17 14:34:31,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1061194248, now seen corresponding path program 1 times [2025-03-17 14:34:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:31,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-03-17 14:34:31,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:31,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:31,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:31,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:31,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:31,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-03-17 14:34:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635420595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:31,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229692835] [2025-03-17 14:34:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:31,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:31,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:31,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:31,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:31,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 870 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-17 14:34:31,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:31,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:31,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:31,608 INFO L124 PetriNetUnfolderBase]: 2271/4677 cut-off events. [2025-03-17 14:34:31,608 INFO L125 PetriNetUnfolderBase]: For 8344/8352 co-relation queries the response was YES. [2025-03-17 14:34:31,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14391 conditions, 4677 events. 2271/4677 cut-off events. For 8344/8352 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 28982 event pairs, 588 based on Foata normal form. 121/4726 useless extension candidates. Maximal degree in co-relation 14347. Up to 2977 conditions per place. [2025-03-17 14:34:31,630 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 95 selfloop transitions, 7 changer transitions 16/129 dead transitions. [2025-03-17 14:34:31,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 129 transitions, 1172 flow [2025-03-17 14:34:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-17 14:34:31,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-17 14:34:31,631 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 870 flow. Second operand 3 states and 102 transitions. [2025-03-17 14:34:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 129 transitions, 1172 flow [2025-03-17 14:34:31,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 1070 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-17 14:34:31,649 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 690 flow [2025-03-17 14:34:31,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-03-17 14:34:31,649 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2025-03-17 14:34:31,649 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 690 flow [2025-03-17 14:34:31,649 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-17 14:34:31,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:31,650 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-17 14:34:31,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:34:31,650 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-17 14:34:31,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash -998268438, now seen corresponding path program 1 times [2025-03-17 14:34:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206861751] [2025-03-17 14:34:31,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:31,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:31,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:31,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:31,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:31,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:34:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341793776] [2025-03-17 14:34:31,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:31,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:31,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:34:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:31,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:31,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:34:31,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:34:31,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:31,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:31,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:31,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:34:31,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:34:31,872 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:34:31,873 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-17 14:34:31,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-17 14:34:31,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-17 14:34:31,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-17 14:34:31,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-17 14:34:31,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:34:32,076 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,SelfDestructingSolverStorable15 [2025-03-17 14:34:32,077 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:32,125 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:34:32,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:34:32,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:34:32 BasicIcfg [2025-03-17 14:34:32,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:34:32,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:34:32,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:34:32,132 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:34:32,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:20" (3/4) ... [2025-03-17 14:34:32,134 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:34:32,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:34:32,135 INFO L158 Benchmark]: Toolchain (without parser) took 12882.22ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 111.5MB in the beginning and 483.1MB in the end (delta: -371.6MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2025-03-17 14:34:32,135 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:32,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 91.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:34:32,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.27ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:34:32,135 INFO L158 Benchmark]: Boogie Preprocessor took 57.26ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:32,136 INFO L158 Benchmark]: IcfgBuilder took 543.51ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 47.6MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 14:34:32,136 INFO L158 Benchmark]: TraceAbstraction took 11872.21ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 47.1MB in the beginning and 483.2MB in the end (delta: -436.1MB). Peak memory consumption was 400.5MB. Max. memory is 16.1GB. [2025-03-17 14:34:32,136 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 629.1MB. Free memory was 483.2MB in the beginning and 483.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:32,137 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.76ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 91.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.27ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.26ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 543.51ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 47.6MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11872.21ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 47.1MB in the beginning and 483.2MB in the end (delta: -436.1MB). Peak memory consumption was 400.5MB. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 629.1MB. Free memory was 483.2MB in the beginning and 483.1MB in the end (delta: 84.0kB). 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, 108 edges, 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: 11.7s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1130 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1013 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 601 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4248 IncrementalHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 16 mSDtfsCounter, 4248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1093occurred in iteration=13, InterpolantAutomatonStates: 89, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 410 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 2908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 8/8 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-17 14:34:32,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-?-8fc3dc6-m [2025-03-17 14:34:34,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:34:34,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:34:34,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:34:34,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:34:34,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:34:34,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:34:34,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:34:34,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:34:34,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:34:34,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:34:34,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:34:34,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:34:34,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:34:34,126 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:34:34,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:34:34,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:34:34,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:34,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:34:34,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:34:34,128 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-17 14:34:34,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:34:34,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:34:34,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:34:34,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:34:34,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:34:34,375 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-17 14:34:35,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2397875fb/b1eaa213afc5468f970747ac323485a6/FLAGe5dae0526 [2025-03-17 14:34:35,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:34:35,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-03-17 14:34:35,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2397875fb/b1eaa213afc5468f970747ac323485a6/FLAGe5dae0526 [2025-03-17 14:34:35,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2397875fb/b1eaa213afc5468f970747ac323485a6 [2025-03-17 14:34:35,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:34:35,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:34:35,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:35,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:34:35,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:34:35,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:35" (1/1) ... [2025-03-17 14:34:35,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495ea2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:35, skipping insertion in model container [2025-03-17 14:34:35,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:35" (1/1) ... [2025-03-17 14:34:35,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:34:36,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:36,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:34:36,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:36,149 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:34:36,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36 WrapperNode [2025-03-17 14:34:36,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:36,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:36,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:34:36,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:34:36,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,184 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2025-03-17 14:34:36,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:36,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:34:36,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:34:36,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:34:36,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,220 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-17 14:34:36,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:34:36,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:34:36,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:34:36,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:34:36,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (1/1) ... [2025-03-17 14:34:36,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:36,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:36,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:34:36,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 14:34:36,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 14:34:36,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 14:34:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 14:34:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 14:34:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 14:34:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 14:34:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 14:34:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:34:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:34:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:34:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:34:36,304 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:34:36,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:34:36,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:34:36,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-03-17 14:34:36,662 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:34:36,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:34:36,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:34:36,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:34:36,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:36 BoogieIcfgContainer [2025-03-17 14:34:36,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:34:36,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:34:36,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:34:36,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:34:36,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:34:35" (1/3) ... [2025-03-17 14:34:36,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b15ab48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:36, skipping insertion in model container [2025-03-17 14:34:36,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:36" (2/3) ... [2025-03-17 14:34:36,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b15ab48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:36, skipping insertion in model container [2025-03-17 14:34:36,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:36" (3/3) ... [2025-03-17 14:34:36,829 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-03-17 14:34:36,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:34:36,841 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-17 14:34:36,841 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:34:36,893 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:34:36,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-03-17 14:34:36,950 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-03-17 14:34:36,953 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:36,956 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 151 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-17 14:34:36,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-03-17 14:34:36,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-03-17 14:34:36,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:34:36,972 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;@5422c853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:34:36,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 14:34:36,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:34:36,979 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-17 14:34:36,979 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:36,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:36,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:36,980 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-17 14:34:36,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1362143742, now seen corresponding path program 1 times [2025-03-17 14:34:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448281721] [2025-03-17 14:34:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:36,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:36,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:34:37,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:37,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:37,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:37,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:37,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:34:37,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:37,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:37,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448281721] [2025-03-17 14:34:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448281721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:37,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43060284] [2025-03-17 14:34:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:37,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:37,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:37,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:37,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:37,241 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-17 14:34:37,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:37,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:37,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:37,494 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-03-17 14:34:37,495 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-17 14:34:37,497 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 4442 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-17 14:34:37,503 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-03-17 14:34:37,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-03-17 14:34:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-17 14:34:37,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-17 14:34:37,515 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-03-17 14:34:37,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-03-17 14:34:37,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:34:37,520 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-03-17 14:34:37,523 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-17 14:34:37,526 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-17 14:34:37,526 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-03-17 14:34:37,526 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-17 14:34:37,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:37,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:37,534 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-17 14:34:37,731 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-17 14:34:37,731 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-17 14:34:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1362143741, now seen corresponding path program 1 times [2025-03-17 14:34:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846159359] [2025-03-17 14:34:37,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:37,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:37,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:34:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:37,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:37,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:37,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:37,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:34:37,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:37,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:37,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846159359] [2025-03-17 14:34:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846159359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:37,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:37,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800658054] [2025-03-17 14:34:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:37,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:37,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:37,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:37,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:37,965 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-17 14:34:37,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:37,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:37,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:38,201 INFO L124 PetriNetUnfolderBase]: 778/1474 cut-off events. [2025-03-17 14:34:38,202 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 14:34:38,206 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 7764 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-17 14:34:38,211 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-17 14:34:38,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2025-03-17 14:34:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-03-17 14:34:38,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-03-17 14:34:38,213 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2025-03-17 14:34:38,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2025-03-17 14:34:38,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:38,215 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2025-03-17 14:34:38,215 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-17 14:34:38,216 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-03-17 14:34:38,216 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2025-03-17 14:34:38,216 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-17 14:34:38,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:38,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:38,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:38,416 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-17 14:34:38,417 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-17 14:34:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash -772793118, now seen corresponding path program 1 times [2025-03-17 14:34:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127556942] [2025-03-17 14:34:38,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:38,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:38,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:38,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:34:38,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:34:38,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:34:38,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:38,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:38,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:34:38,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:38,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:38,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127556942] [2025-03-17 14:34:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127556942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104533572] [2025-03-17 14:34:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:38,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:38,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:38,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:38,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:38,584 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-17 14:34:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:38,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:38,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:38,851 INFO L124 PetriNetUnfolderBase]: 977/1972 cut-off events. [2025-03-17 14:34:38,851 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-17 14:34:38,854 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 10722 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-17 14:34:38,859 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-17 14:34:38,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2025-03-17 14:34:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-17 14:34:38,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2025-03-17 14:34:38,861 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2025-03-17 14:34:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2025-03-17 14:34:38,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:38,862 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2025-03-17 14:34:38,862 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-17 14:34:38,864 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-17 14:34:38,864 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2025-03-17 14:34:38,864 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-17 14:34:38,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:38,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:38,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:34:39,065 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-17 14:34:39,065 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-17 14:34:39,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2078620, now seen corresponding path program 1 times [2025-03-17 14:34:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33466584] [2025-03-17 14:34:39,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:39,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:39,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:34:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:34:39,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:34:39,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:39,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:39,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:34:39,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:39,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:39,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:39,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33466584] [2025-03-17 14:34:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33466584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:39,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803367052] [2025-03-17 14:34:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:39,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:39,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:39,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:39,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:39,169 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-17 14:34:39,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:39,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:39,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:39,360 INFO L124 PetriNetUnfolderBase]: 982/1958 cut-off events. [2025-03-17 14:34:39,360 INFO L125 PetriNetUnfolderBase]: For 401/421 co-relation queries the response was YES. [2025-03-17 14:34:39,364 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 10952 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-17 14:34:39,383 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 30 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2025-03-17 14:34:39,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 195 flow [2025-03-17 14:34:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-17 14:34:39,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-03-17 14:34:39,386 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 91 transitions. [2025-03-17 14:34:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 195 flow [2025-03-17 14:34:39,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:39,388 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow [2025-03-17 14:34:39,388 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-17 14:34:39,389 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-17 14:34:39,389 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow [2025-03-17 14:34:39,389 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-17 14:34:39,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:39,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:39,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:34:39,594 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-17 14:34:39,594 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-17 14:34:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1913997954, now seen corresponding path program 1 times [2025-03-17 14:34:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75878495] [2025-03-17 14:34:39,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:39,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:39,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:39,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:39,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:34:39,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:34:39,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:34:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:39,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:34:39,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:39,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:39,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75878495] [2025-03-17 14:34:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75878495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:39,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:39,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:34:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092269244] [2025-03-17 14:34:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:39,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:39,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:39,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:39,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:39,682 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-17 14:34:39,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:39,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:39,930 INFO L124 PetriNetUnfolderBase]: 1101/2176 cut-off events. [2025-03-17 14:34:39,931 INFO L125 PetriNetUnfolderBase]: For 395/427 co-relation queries the response was YES. [2025-03-17 14:34:39,932 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 12310 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-17 14:34:39,937 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 46 selfloop transitions, 4 changer transitions 2/66 dead transitions. [2025-03-17 14:34:39,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 284 flow [2025-03-17 14:34:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-17 14:34:39,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-03-17 14:34:39,939 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 110 transitions. [2025-03-17 14:34:39,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 284 flow [2025-03-17 14:34:39,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:39,942 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 149 flow [2025-03-17 14:34:39,943 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-17 14:34:39,943 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-17 14:34:39,944 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 149 flow [2025-03-17 14:34:39,944 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-17 14:34:39,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:39,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:39,951 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-17 14:34:40,145 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-17 14:34:40,145 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-17 14:34:40,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash -21186010, now seen corresponding path program 1 times [2025-03-17 14:34:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128534260] [2025-03-17 14:34:40,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:40,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:40,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:40,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:40,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:34:40,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:34:40,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:34:40,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:40,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:40,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:34:40,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:40,235 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-17 14:34:40,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:40,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128534260] [2025-03-17 14:34:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128534260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:40,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812021825] [2025-03-17 14:34:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:40,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:40,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-03-17 14:34:40,238 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-17 14:34:40,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:40,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-03-17 14:34:40,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:40,472 INFO L124 PetriNetUnfolderBase]: 1020/2022 cut-off events. [2025-03-17 14:34:40,472 INFO L125 PetriNetUnfolderBase]: For 286/298 co-relation queries the response was YES. [2025-03-17 14:34:40,474 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 10006 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-17 14:34:40,479 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 41 selfloop transitions, 3 changer transitions 2/61 dead transitions. [2025-03-17 14:34:40,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 267 flow [2025-03-17 14:34:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-17 14:34:40,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2025-03-17 14:34:40,480 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 149 flow. Second operand 3 states and 105 transitions. [2025-03-17 14:34:40,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 267 flow [2025-03-17 14:34:40,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:40,483 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 153 flow [2025-03-17 14:34:40,483 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-17 14:34:40,484 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-17 14:34:40,484 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 153 flow [2025-03-17 14:34:40,484 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-17 14:34:40,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:40,484 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-17 14:34:40,491 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-17 14:34:40,684 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-17 14:34:40,685 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-17 14:34:40,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 627154513, now seen corresponding path program 1 times [2025-03-17 14:34:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:40,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157476718] [2025-03-17 14:34:40,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:40,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:40,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:40,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:34:40,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:34:40,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:34:40,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:40,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:40,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:34:40,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:40,792 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-17 14:34:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:40,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:40,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157476718] [2025-03-17 14:34:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157476718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:40,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:40,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057520301] [2025-03-17 14:34:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:40,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:40,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:40,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:40,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:40,817 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-17 14:34:40,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:40,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:40,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:40,991 INFO L124 PetriNetUnfolderBase]: 663/1504 cut-off events. [2025-03-17 14:34:40,992 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-03-17 14:34:40,994 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 7128 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-17 14:34:40,997 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-17 14:34:40,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 257 flow [2025-03-17 14:34:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-17 14:34:40,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-03-17 14:34:40,998 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 153 flow. Second operand 3 states and 104 transitions. [2025-03-17 14:34:40,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 257 flow [2025-03-17 14:34:41,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:41,001 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 155 flow [2025-03-17 14:34:41,002 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-17 14:34:41,002 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-17 14:34:41,003 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 155 flow [2025-03-17 14:34:41,003 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-17 14:34:41,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:41,004 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-17 14:34:41,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:34:41,204 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-17 14:34:41,204 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-17 14:34:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 420553971, now seen corresponding path program 1 times [2025-03-17 14:34:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965891592] [2025-03-17 14:34:41,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:41,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:41,207 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-17 14:34:41,208 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-17 14:34:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:34:41,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:34:41,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:41,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:41,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:34:41,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:41,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:41,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:41,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965891592] [2025-03-17 14:34:41,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965891592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:41,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44586066] [2025-03-17 14:34:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:41,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:34:41,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:41,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:34:41,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:34:41,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:41,559 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-17 14:34:41,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:41,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:41,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:41,878 INFO L124 PetriNetUnfolderBase]: 1336/2886 cut-off events. [2025-03-17 14:34:41,878 INFO L125 PetriNetUnfolderBase]: For 637/641 co-relation queries the response was YES. [2025-03-17 14:34:41,881 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 15737 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-17 14:34:41,886 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 78 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-17 14:34:41,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 479 flow [2025-03-17 14:34:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-03-17 14:34:41,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681034482758621 [2025-03-17 14:34:41,889 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 155 flow. Second operand 4 states and 155 transitions. [2025-03-17 14:34:41,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 479 flow [2025-03-17 14:34:41,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:41,893 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-03-17 14:34:41,894 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-17 14:34:41,894 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-17 14:34:41,895 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-03-17 14:34:41,895 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-17 14:34:41,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:41,895 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-17 14:34:41,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:34:42,100 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-17 14:34:42,100 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-17 14:34:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1813623051, now seen corresponding path program 1 times [2025-03-17 14:34:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070498247] [2025-03-17 14:34:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:42,102 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-17 14:34:42,103 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-17 14:34:42,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:34:42,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:34:42,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:42,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:42,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:34:42,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:42,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:42,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070498247] [2025-03-17 14:34:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070498247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848955191] [2025-03-17 14:34:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:42,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:42,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-03-17 14:34:42,317 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-17 14:34:42,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:42,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-03-17 14:34:42,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:42,547 INFO L124 PetriNetUnfolderBase]: 937/2051 cut-off events. [2025-03-17 14:34:42,548 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-03-17 14:34:42,550 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 10097 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-17 14:34:42,554 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2025-03-17 14:34:42,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 356 flow [2025-03-17 14:34:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-17 14:34:42,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2025-03-17 14:34:42,555 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 4 states and 142 transitions. [2025-03-17 14:34:42,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 356 flow [2025-03-17 14:34:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:34:42,558 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 177 flow [2025-03-17 14:34:42,558 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-17 14:34:42,558 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-17 14:34:42,558 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 177 flow [2025-03-17 14:34:42,558 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-17 14:34:42,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:42,558 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-17 14:34:42,568 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-17 14:34:42,760 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-17 14:34:42,760 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-17 14:34:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 107517104, now seen corresponding path program 1 times [2025-03-17 14:34:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118026597] [2025-03-17 14:34:42,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:42,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:42,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:42,763 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-17 14:34:42,765 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-17 14:34:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:42,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:42,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:42,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:42,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:34:42,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:43,082 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-17 14:34:43,257 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-17 14:34:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:43,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:43,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:43,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118026597] [2025-03-17 14:34:43,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118026597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:43,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:43,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:34:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659878869] [2025-03-17 14:34:43,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:43,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:34:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:43,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:34:43,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:34:43,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:43,435 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-17 14:34:43,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:43,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:43,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:44,076 INFO L124 PetriNetUnfolderBase]: 1096/2374 cut-off events. [2025-03-17 14:34:44,077 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2025-03-17 14:34:44,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 2374 events. 1096/2374 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12271 event pairs, 450 based on Foata normal form. 27/2358 useless extension candidates. Maximal degree in co-relation 4920. Up to 1398 conditions per place. [2025-03-17 14:34:44,088 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 81 selfloop transitions, 14 changer transitions 17/127 dead transitions. [2025-03-17 14:34:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 621 flow [2025-03-17 14:34:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:34:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:34:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 322 transitions. [2025-03-17 14:34:44,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5047021943573667 [2025-03-17 14:34:44,089 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 177 flow. Second operand 11 states and 322 transitions. [2025-03-17 14:34:44,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 621 flow [2025-03-17 14:34:44,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 127 transitions, 612 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:34:44,092 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 289 flow [2025-03-17 14:34:44,092 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-17 14:34:44,095 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-03-17 14:34:44,095 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 289 flow [2025-03-17 14:34:44,095 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-17 14:34:44,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:44,095 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-17 14:34:44,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:44,298 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-17 14:34:44,299 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-17 14:34:44,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1386637264, now seen corresponding path program 2 times [2025-03-17 14:34:44,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:44,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128887986] [2025-03-17 14:34:44,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:44,301 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-17 14:34:44,302 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-17 14:34:44,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:44,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:44,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:34:44,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:44,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:34:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:44,602 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-17 14:34:44,787 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-17 14:34:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:44,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:44,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128887986] [2025-03-17 14:34:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128887986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:34:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221406393] [2025-03-17 14:34:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:34:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:44,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:34:44,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:34:44,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:44,941 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-17 14:34:44,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:44,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:44,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:45,562 INFO L124 PetriNetUnfolderBase]: 1235/2687 cut-off events. [2025-03-17 14:34:45,562 INFO L125 PetriNetUnfolderBase]: For 2661/2661 co-relation queries the response was YES. [2025-03-17 14:34:45,565 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 14482 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-17 14:34:45,570 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 89 selfloop transitions, 20 changer transitions 10/134 dead transitions. [2025-03-17 14:34:45,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 843 flow [2025-03-17 14:34:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:34:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:34:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 320 transitions. [2025-03-17 14:34:45,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5015673981191222 [2025-03-17 14:34:45,571 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 289 flow. Second operand 11 states and 320 transitions. [2025-03-17 14:34:45,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 843 flow [2025-03-17 14:34:45,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 828 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:34:45,581 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 500 flow [2025-03-17 14:34:45,581 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-17 14:34:45,581 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-03-17 14:34:45,581 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 500 flow [2025-03-17 14:34:45,581 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-17 14:34:45,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:45,581 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-17 14:34:45,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:34:45,788 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-17 14:34:45,789 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-17 14:34:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 354991608, now seen corresponding path program 3 times [2025-03-17 14:34:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:45,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247916700] [2025-03-17 14:34:45,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:34:45,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:45,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:45,792 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-17 14:34:45,793 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-17 14:34:45,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:45,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:45,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:34:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:45,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:34:45,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:46,091 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-17 14:34:46,211 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-17 14:34:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:46,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:46,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247916700] [2025-03-17 14:34:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247916700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:46,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:46,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:34:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232620765] [2025-03-17 14:34:46,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:46,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:34:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:46,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:34:46,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:34:46,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:46,359 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-17 14:34:46,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:46,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:46,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:47,109 INFO L124 PetriNetUnfolderBase]: 1395/3046 cut-off events. [2025-03-17 14:34:47,110 INFO L125 PetriNetUnfolderBase]: For 6665/6669 co-relation queries the response was YES. [2025-03-17 14:34:47,115 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 16899 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-17 14:34:47,121 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 108 selfloop transitions, 20 changer transitions 4/147 dead transitions. [2025-03-17 14:34:47,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1088 flow [2025-03-17 14:34:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:34:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:34:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 317 transitions. [2025-03-17 14:34:47,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49686520376175547 [2025-03-17 14:34:47,123 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 500 flow. Second operand 11 states and 317 transitions. [2025-03-17 14:34:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1088 flow [2025-03-17 14:34:47,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 147 transitions, 1014 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:47,136 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 631 flow [2025-03-17 14:34:47,136 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-17 14:34:47,137 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2025-03-17 14:34:47,137 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 631 flow [2025-03-17 14:34:47,137 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-17 14:34:47,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:47,137 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-17 14:34:47,146 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-17 14:34:47,337 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-17 14:34:47,338 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-17 14:34:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1856318936, now seen corresponding path program 4 times [2025-03-17 14:34:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652437742] [2025-03-17 14:34:47,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:34:47,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:47,340 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-17 14:34:47,342 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-17 14:34:47,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:34:47,436 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:47,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:34:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:47,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:34:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:47,569 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-17 14:34:47,702 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-17 14:34:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:47,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:47,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:34:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652437742] [2025-03-17 14:34:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652437742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:34:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067990199] [2025-03-17 14:34:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:34:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:34:47,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:34:47,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:34:47,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-03-17 14:34:47,823 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-17 14:34:47,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:47,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-03-17 14:34:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:48,527 INFO L124 PetriNetUnfolderBase]: 1539/3346 cut-off events. [2025-03-17 14:34:48,527 INFO L125 PetriNetUnfolderBase]: For 8026/8036 co-relation queries the response was YES. [2025-03-17 14:34:48,534 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 19089 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-17 14:34:48,540 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 97 selfloop transitions, 52 changer transitions 11/175 dead transitions. [2025-03-17 14:34:48,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1341 flow [2025-03-17 14:34:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:34:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:34:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 397 transitions. [2025-03-17 14:34:48,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48891625615763545 [2025-03-17 14:34:48,542 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 631 flow. Second operand 14 states and 397 transitions. [2025-03-17 14:34:48,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1341 flow [2025-03-17 14:34:48,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 175 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-17 14:34:48,555 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 849 flow [2025-03-17 14:34:48,555 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-17 14:34:48,556 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2025-03-17 14:34:48,556 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 849 flow [2025-03-17 14:34:48,556 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-17 14:34:48,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:48,556 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-17 14:34:48,564 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-17 14:34:48,756 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-17 14:34:48,756 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-17 14:34:48,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -280027670, now seen corresponding path program 1 times [2025-03-17 14:34:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:34:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852736276] [2025-03-17 14:34:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:48,760 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-17 14:34:48,762 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-17 14:34:48,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:48,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:48,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:48,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:34:48,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:34:48,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 14:34:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 14:34:48,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:34:48,949 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:34:48,950 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:34:48,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-17 14:34:48,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-17 14:34:48,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-17 14:34:48,961 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-17 14:34:49,153 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-17 14:34:49,153 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:49,196 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:34:49,197 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:34:49,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:34:49 BasicIcfg [2025-03-17 14:34:49,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:34:49,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:34:49,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:34:49,204 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:34:49,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:36" (3/4) ... [2025-03-17 14:34:49,205 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:34:49,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:34:49,207 INFO L158 Benchmark]: Toolchain (without parser) took 13420.81ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.8MB in the beginning and 148.9MB in the end (delta: -57.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2025-03-17 14:34:49,208 INFO L158 Benchmark]: CDTParser took 0.83ms. 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-17 14:34:49,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.89ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 69.4MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:34:49,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.98ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 67.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:49,208 INFO L158 Benchmark]: Boogie Preprocessor took 64.93ms. 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-17 14:34:49,208 INFO L158 Benchmark]: IcfgBuilder took 569.71ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-03-17 14:34:49,208 INFO L158 Benchmark]: TraceAbstraction took 12380.12ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 61.5MB in the beginning and 148.9MB in the end (delta: -87.4MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2025-03-17 14:34:49,208 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 148.9MB in the end (delta: 18.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:49,209 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.83ms. 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 361.89ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 69.4MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.98ms. Allocated memory is still 117.4MB. Free memory was 69.4MB 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 64.93ms. 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 569.71ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12380.12ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 61.5MB in the beginning and 148.9MB in the end (delta: -87.4MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 148.9MB in the end (delta: 18.2kB). 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, 108 edges, 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.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 2.9s 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.3s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3042 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 123 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-17 14:34:49,232 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