./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 13:14:00,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:00,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:14:00,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:00,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:00,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:00,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:00,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:00,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:00,327 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:00,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:00,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:00,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:00,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:00,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:00,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:00,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:00,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:00,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:00,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:00,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:00,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:00,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:00,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:00,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:00,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:00,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:14:00,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:14:00,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:00,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:00,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:00,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:00,334 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-jdk21/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-02-06 13:14:00,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:00,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:00,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:00,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:00,616 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:00,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 13:14:01,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/085304014/3097e744e0114c8eb91166162333fdf0/FLAGd4039e3d0 [2025-02-06 13:14:02,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:02,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 13:14:02,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/085304014/3097e744e0114c8eb91166162333fdf0/FLAGd4039e3d0 [2025-02-06 13:14:02,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/085304014/3097e744e0114c8eb91166162333fdf0 [2025-02-06 13:14:02,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:02,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:02,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:02,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:02,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:02,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100318ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02, skipping insertion in model container [2025-02-06 13:14:02,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:02,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:02,632 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:02,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:02,706 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:02,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02 WrapperNode [2025-02-06 13:14:02,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:02,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:02,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:02,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:02,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,744 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-02-06 13:14:02,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:02,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:02,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:02,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:02,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,776 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-02-06 13:14:02,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:02,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:02,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:02,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:02,792 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (1/1) ... [2025-02-06 13:14:02,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:02,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:14:02,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 13:14:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 13:14:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 13:14:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 13:14:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:02,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:02,846 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:02,944 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:02,946 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:03,151 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-02-06 13:14:03,152 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:03,152 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:03,253 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:03,253 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:03,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:03 BoogieIcfgContainer [2025-02-06 13:14:03,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:03,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:03,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:03,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:03,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:02" (1/3) ... [2025-02-06 13:14:03,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f73bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:03, skipping insertion in model container [2025-02-06 13:14:03,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:02" (2/3) ... [2025-02-06 13:14:03,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f73bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:03, skipping insertion in model container [2025-02-06 13:14:03,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:03" (3/3) ... [2025-02-06 13:14:03,260 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-02-06 13:14:03,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:03,271 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-02-06 13:14:03,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:03,338 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:03,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-02-06 13:14:03,376 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-02-06 13:14:03,378 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:03,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-02-06 13:14:03,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-02-06 13:14:03,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-02-06 13:14:03,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:03,409 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;@2e0ba40c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:03,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 13:14:03,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:03,417 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-02-06 13:14:03,417 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:03,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:03,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:03,418 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-02-06 13:14:03,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1195185285, now seen corresponding path program 1 times [2025-02-06 13:14:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955993862] [2025-02-06 13:14:03,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:03,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:03,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:03,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:03,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:03,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-02-06 13:14:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955993862] [2025-02-06 13:14:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955993862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:03,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:03,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986259537] [2025-02-06 13:14:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:03,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:03,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:03,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:03,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:03,746 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-02-06 13:14:03,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:03,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:03,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:03,920 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-02-06 13:14:03,921 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 13:14:03,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 846 events. 435/846 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4438 event pairs, 320 based on Foata normal form. 92/884 useless extension candidates. Maximal degree in co-relation 1494. Up to 691 conditions per place. [2025-02-06 13:14:03,930 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-02-06 13:14:03,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-02-06 13:14:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 13:14:03,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 13:14:03,941 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-02-06 13:14:03,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-02-06 13:14:03,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:03,945 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-02-06 13:14:03,947 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-02-06 13:14:03,949 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-06 13:14:03,949 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-02-06 13:14:03,949 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-02-06 13:14:03,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:03,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:03,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:14:03,950 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-02-06 13:14:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1195185286, now seen corresponding path program 1 times [2025-02-06 13:14:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461028691] [2025-02-06 13:14:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:03,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:03,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:03,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461028691] [2025-02-06 13:14:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461028691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:04,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39117937] [2025-02-06 13:14:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:04,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:04,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:04,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:04,235 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-02-06 13:14:04,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:04,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:04,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:04,418 INFO L124 PetriNetUnfolderBase]: 778/1474 cut-off events. [2025-02-06 13:14:04,418 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 13:14:04,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1474 events. 778/1474 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7754 event pairs, 264 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 2687. Up to 698 conditions per place. [2025-02-06 13:14:04,426 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-02-06 13:14:04,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2025-02-06 13:14:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-02-06 13:14:04,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-02-06 13:14:04,428 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2025-02-06 13:14:04,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2025-02-06 13:14:04,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:04,430 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2025-02-06 13:14:04,431 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-02-06 13:14:04,431 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-02-06 13:14:04,431 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2025-02-06 13:14:04,431 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-02-06 13:14:04,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:04,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:14:04,432 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-02-06 13:14:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 486356770, now seen corresponding path program 1 times [2025-02-06 13:14:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298949247] [2025-02-06 13:14:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:04,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:14:04,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:14:04,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:04,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:04,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:04,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298949247] [2025-02-06 13:14:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298949247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:04,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:04,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202187542] [2025-02-06 13:14:04,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:04,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:04,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:04,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:04,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:04,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:04,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:04,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:04,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:04,734 INFO L124 PetriNetUnfolderBase]: 820/1503 cut-off events. [2025-02-06 13:14:04,734 INFO L125 PetriNetUnfolderBase]: For 51/57 co-relation queries the response was YES. [2025-02-06 13:14:04,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1503 events. 820/1503 cut-off events. For 51/57 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7688 event pairs, 607 based on Foata normal form. 0/1402 useless extension candidates. Maximal degree in co-relation 2908. Up to 1276 conditions per place. [2025-02-06 13:14:04,739 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-02-06 13:14:04,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2025-02-06 13:14:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 13:14:04,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2025-02-06 13:14:04,742 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2025-02-06 13:14:04,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2025-02-06 13:14:04,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:04,743 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2025-02-06 13:14:04,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-02-06 13:14:04,743 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-06 13:14:04,743 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2025-02-06 13:14:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:04,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:04,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:04,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:14:04,744 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-02-06 13:14:04,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 381019039, now seen corresponding path program 1 times [2025-02-06 13:14:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332562141] [2025-02-06 13:14:04,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:14:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:14:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:04,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332562141] [2025-02-06 13:14:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332562141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:04,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:04,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112715308] [2025-02-06 13:14:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:04,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:04,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:04,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:04,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:04,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:04,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:04,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:04,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:04,937 INFO L124 PetriNetUnfolderBase]: 1069/1959 cut-off events. [2025-02-06 13:14:04,938 INFO L125 PetriNetUnfolderBase]: For 87/104 co-relation queries the response was YES. [2025-02-06 13:14:04,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 1959 events. 1069/1959 cut-off events. For 87/104 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11310 event pairs, 507 based on Foata normal form. 24/1902 useless extension candidates. Maximal degree in co-relation 3743. Up to 1132 conditions per place. [2025-02-06 13:14:04,946 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-02-06 13:14:04,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2025-02-06 13:14:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 13:14:04,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 13:14:04,948 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2025-02-06 13:14:04,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2025-02-06 13:14:04,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:04,949 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2025-02-06 13:14:04,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-02-06 13:14:04,950 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-02-06 13:14:04,950 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2025-02-06 13:14:04,950 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-02-06 13:14:04,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:04,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:04,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:14:04,950 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-02-06 13:14:04,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1243234334, now seen corresponding path program 1 times [2025-02-06 13:14:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:04,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892681562] [2025-02-06 13:14:04,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:04,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:14:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:14:04,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:04,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:05,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892681562] [2025-02-06 13:14:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892681562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099235700] [2025-02-06 13:14:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:05,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:05,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:05,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:05,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:05,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:05,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:05,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:05,235 INFO L124 PetriNetUnfolderBase]: 1303/2479 cut-off events. [2025-02-06 13:14:05,236 INFO L125 PetriNetUnfolderBase]: For 239/255 co-relation queries the response was YES. [2025-02-06 13:14:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 2479 events. 1303/2479 cut-off events. For 239/255 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14348 event pairs, 486 based on Foata normal form. 48/2472 useless extension candidates. Maximal degree in co-relation 4953. Up to 1292 conditions per place. [2025-02-06 13:14:05,248 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-02-06 13:14:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2025-02-06 13:14:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-02-06 13:14:05,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2025-02-06 13:14:05,252 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2025-02-06 13:14:05,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2025-02-06 13:14:05,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:05,254 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2025-02-06 13:14:05,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-02-06 13:14:05,254 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-06 13:14:05,255 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2025-02-06 13:14:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:05,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:05,255 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-02-06 13:14:05,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:14:05,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1340709595, now seen corresponding path program 1 times [2025-02-06 13:14:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405945659] [2025-02-06 13:14:05,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:05,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:14:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:14:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:05,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405945659] [2025-02-06 13:14:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405945659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961660656] [2025-02-06 13:14:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:05,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:05,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:05,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:05,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:05,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:05,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:05,612 INFO L124 PetriNetUnfolderBase]: 2132/4076 cut-off events. [2025-02-06 13:14:05,612 INFO L125 PetriNetUnfolderBase]: For 730/762 co-relation queries the response was YES. [2025-02-06 13:14:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8487 conditions, 4076 events. 2132/4076 cut-off events. For 730/762 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26544 event pairs, 977 based on Foata normal form. 69/4034 useless extension candidates. Maximal degree in co-relation 8475. Up to 2078 conditions per place. [2025-02-06 13:14:05,628 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-02-06 13:14:05,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2025-02-06 13:14:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-06 13:14:05,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-02-06 13:14:05,630 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2025-02-06 13:14:05,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2025-02-06 13:14:05,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:05,632 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2025-02-06 13:14:05,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-02-06 13:14:05,632 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-02-06 13:14:05,632 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2025-02-06 13:14:05,637 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-02-06 13:14:05,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:05,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:05,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:14:05,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash -859044378, now seen corresponding path program 1 times [2025-02-06 13:14:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58602397] [2025-02-06 13:14:05,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:05,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:14:05,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:14:05,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:05,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58602397] [2025-02-06 13:14:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58602397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411067081] [2025-02-06 13:14:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:05,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:05,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:05,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:05,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:05,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:05,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:05,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:05,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:05,919 INFO L124 PetriNetUnfolderBase]: 1676/3241 cut-off events. [2025-02-06 13:14:05,919 INFO L125 PetriNetUnfolderBase]: For 679/685 co-relation queries the response was YES. [2025-02-06 13:14:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 3241 events. 1676/3241 cut-off events. For 679/685 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20300 event pairs, 743 based on Foata normal form. 86/3249 useless extension candidates. Maximal degree in co-relation 6984. Up to 1575 conditions per place. [2025-02-06 13:14:05,934 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-02-06 13:14:05,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2025-02-06 13:14:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-02-06 13:14:05,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2025-02-06 13:14:05,935 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-02-06 13:14:05,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2025-02-06 13:14:05,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:05,939 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2025-02-06 13:14:05,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-02-06 13:14:05,940 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-02-06 13:14:05,940 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2025-02-06 13:14:05,941 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-02-06 13:14:05,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:05,941 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-02-06 13:14:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:14:05,941 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-02-06 13:14:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 423348884, now seen corresponding path program 1 times [2025-02-06 13:14:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723051770] [2025-02-06 13:14:05,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:05,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:14:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:14:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723051770] [2025-02-06 13:14:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723051770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804771697] [2025-02-06 13:14:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:06,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:06,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:06,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:06,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:06,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:06,188 INFO L124 PetriNetUnfolderBase]: 1070/2329 cut-off events. [2025-02-06 13:14:06,188 INFO L125 PetriNetUnfolderBase]: For 780/780 co-relation queries the response was YES. [2025-02-06 13:14:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 2329 events. 1070/2329 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14066 event pairs, 335 based on Foata normal form. 126/2418 useless extension candidates. Maximal degree in co-relation 5090. Up to 1144 conditions per place. [2025-02-06 13:14:06,196 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-02-06 13:14:06,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2025-02-06 13:14:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-06 13:14:06,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-02-06 13:14:06,197 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2025-02-06 13:14:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2025-02-06 13:14:06,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:06,200 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2025-02-06 13:14:06,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-02-06 13:14:06,201 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-02-06 13:14:06,201 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2025-02-06 13:14:06,201 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-02-06 13:14:06,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:06,201 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-02-06 13:14:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:14:06,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1602453229, now seen corresponding path program 1 times [2025-02-06 13:14:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386633798] [2025-02-06 13:14:06,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:06,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:14:06,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:14:06,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:06,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386633798] [2025-02-06 13:14:06,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386633798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:06,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055380548] [2025-02-06 13:14:06,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:06,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:06,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:06,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:06,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:06,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:06,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:06,610 INFO L124 PetriNetUnfolderBase]: 1594/3343 cut-off events. [2025-02-06 13:14:06,610 INFO L125 PetriNetUnfolderBase]: For 1242/1244 co-relation queries the response was YES. [2025-02-06 13:14:06,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7765 conditions, 3343 events. 1594/3343 cut-off events. For 1242/1244 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19543 event pairs, 913 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 7752. Up to 1748 conditions per place. [2025-02-06 13:14:06,647 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 77 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-02-06 13:14:06,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 461 flow [2025-02-06 13:14:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-02-06 13:14:06,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-02-06 13:14:06,651 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 4 states and 156 transitions. [2025-02-06 13:14:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 461 flow [2025-02-06 13:14:06,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:06,654 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 159 flow [2025-02-06 13:14:06,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-02-06 13:14:06,660 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-02-06 13:14:06,660 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 159 flow [2025-02-06 13:14:06,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:06,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:06,660 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-02-06 13:14:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:14:06,660 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-02-06 13:14:06,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:06,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1130967520, now seen corresponding path program 1 times [2025-02-06 13:14:06,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:06,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315582364] [2025-02-06 13:14:06,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:14:06,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:14:06,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315582364] [2025-02-06 13:14:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315582364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411531033] [2025-02-06 13:14:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:06,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:06,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:06,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:06,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:06,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,090 INFO L124 PetriNetUnfolderBase]: 1237/2629 cut-off events. [2025-02-06 13:14:07,090 INFO L125 PetriNetUnfolderBase]: For 958/964 co-relation queries the response was YES. [2025-02-06 13:14:07,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 2629 events. 1237/2629 cut-off events. For 958/964 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14431 event pairs, 516 based on Foata normal form. 28/2589 useless extension candidates. Maximal degree in co-relation 5955. Up to 1667 conditions per place. [2025-02-06 13:14:07,101 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-02-06 13:14:07,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 318 flow [2025-02-06 13:14:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-02-06 13:14:07,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2025-02-06 13:14:07,103 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 159 flow. Second operand 3 states and 109 transitions. [2025-02-06 13:14:07,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 318 flow [2025-02-06 13:14:07,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:07,105 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2025-02-06 13:14:07,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-02-06 13:14:07,106 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-02-06 13:14:07,106 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2025-02-06 13:14:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:07,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,106 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-02-06 13:14:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:14:07,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:07,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1398445835, now seen corresponding path program 1 times [2025-02-06 13:14:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879445915] [2025-02-06 13:14:07,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:07,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:07,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:07,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879445915] [2025-02-06 13:14:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879445915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192611547] [2025-02-06 13:14:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:07,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:07,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:07,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:07,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:07,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,435 INFO L124 PetriNetUnfolderBase]: 1705/3759 cut-off events. [2025-02-06 13:14:07,436 INFO L125 PetriNetUnfolderBase]: For 1404/1408 co-relation queries the response was YES. [2025-02-06 13:14:07,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 3759 events. 1705/3759 cut-off events. For 1404/1408 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 23918 event pairs, 650 based on Foata normal form. 104/3757 useless extension candidates. Maximal degree in co-relation 8518. Up to 1740 conditions per place. [2025-02-06 13:14:07,447 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 79 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-02-06 13:14:07,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 488 flow [2025-02-06 13:14:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-02-06 13:14:07,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2025-02-06 13:14:07,448 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 4 states and 159 transitions. [2025-02-06 13:14:07,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 488 flow [2025-02-06 13:14:07,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:07,450 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 173 flow [2025-02-06 13:14:07,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-02-06 13:14:07,451 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-02-06 13:14:07,451 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 173 flow [2025-02-06 13:14:07,451 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-02-06 13:14:07,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,451 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-02-06 13:14:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:14:07,452 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-02-06 13:14:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1857606310, now seen corresponding path program 1 times [2025-02-06 13:14:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761711733] [2025-02-06 13:14:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:07,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:07,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:07,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:14:07,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160846487] [2025-02-06 13:14:07,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:07,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:07,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:14:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:07,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:07,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:14:07,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:07,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761711733] [2025-02-06 13:14:07,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:14:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160846487] [2025-02-06 13:14:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160846487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:07,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529825671] [2025-02-06 13:14:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:07,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:07,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:07,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:07,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:07,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,938 INFO L124 PetriNetUnfolderBase]: 1410/3072 cut-off events. [2025-02-06 13:14:07,938 INFO L125 PetriNetUnfolderBase]: For 1935/1937 co-relation queries the response was YES. [2025-02-06 13:14:07,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7503 conditions, 3072 events. 1410/3072 cut-off events. For 1935/1937 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17876 event pairs, 452 based on Foata normal form. 26/3034 useless extension candidates. Maximal degree in co-relation 7484. Up to 1232 conditions per place. [2025-02-06 13:14:07,950 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 66 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-02-06 13:14:07,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 448 flow [2025-02-06 13:14:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-06 13:14:07,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2025-02-06 13:14:07,952 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 173 flow. Second operand 4 states and 144 transitions. [2025-02-06 13:14:07,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 448 flow [2025-02-06 13:14:07,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 434 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:07,954 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 177 flow [2025-02-06 13:14:07,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-02-06 13:14:07,954 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2025-02-06 13:14:07,955 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 177 flow [2025-02-06 13:14:07,955 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-02-06 13:14:07,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,955 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-02-06 13:14:07,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:14:08,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 13:14:08,156 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-02-06 13:14:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 85652572, now seen corresponding path program 1 times [2025-02-06 13:14:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816682543] [2025-02-06 13:14:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:08,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:08,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816682543] [2025-02-06 13:14:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816682543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:08,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:14:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067352619] [2025-02-06 13:14:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:08,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:14:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:08,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:14:08,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:14:08,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:08,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 177 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:08,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:08,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:09,497 INFO L124 PetriNetUnfolderBase]: 1636/3544 cut-off events. [2025-02-06 13:14:09,497 INFO L125 PetriNetUnfolderBase]: For 2083/2089 co-relation queries the response was YES. [2025-02-06 13:14:09,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8632 conditions, 3544 events. 1636/3544 cut-off events. For 2083/2089 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 21695 event pairs, 536 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 8611. Up to 1859 conditions per place. [2025-02-06 13:14:09,507 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 112 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2025-02-06 13:14:09,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 798 flow [2025-02-06 13:14:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:14:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 13:14:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 364 transitions. [2025-02-06 13:14:09,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-02-06 13:14:09,509 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 177 flow. Second operand 12 states and 364 transitions. [2025-02-06 13:14:09,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 798 flow [2025-02-06 13:14:09,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 788 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:09,513 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 313 flow [2025-02-06 13:14:09,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=313, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-02-06 13:14:09,513 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-02-06 13:14:09,513 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 313 flow [2025-02-06 13:14:09,513 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-02-06 13:14:09,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:09,514 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-02-06 13:14:09,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:14:09,514 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-02-06 13:14:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1438844360, now seen corresponding path program 2 times [2025-02-06 13:14:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113143829] [2025-02-06 13:14:09,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:14:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:09,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:09,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:09,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:14:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113143829] [2025-02-06 13:14:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113143829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:09,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 13:14:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019184726] [2025-02-06 13:14:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:14:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:09,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:14:09,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:14:09,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:09,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 313 flow. Second operand has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:09,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:09,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:09,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:10,421 INFO L124 PetriNetUnfolderBase]: 2085/4468 cut-off events. [2025-02-06 13:14:10,422 INFO L125 PetriNetUnfolderBase]: For 5398/5404 co-relation queries the response was YES. [2025-02-06 13:14:10,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 4468 events. 2085/4468 cut-off events. For 5398/5404 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 29019 event pairs, 646 based on Foata normal form. 0/4398 useless extension candidates. Maximal degree in co-relation 12426. Up to 2334 conditions per place. [2025-02-06 13:14:10,439 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 116 selfloop transitions, 25 changer transitions 0/156 dead transitions. [2025-02-06 13:14:10,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 156 transitions, 1062 flow [2025-02-06 13:14:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:14:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:14:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 319 transitions. [2025-02-06 13:14:10,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 13:14:10,441 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 313 flow. Second operand 10 states and 319 transitions. [2025-02-06 13:14:10,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 156 transitions, 1062 flow [2025-02-06 13:14:10,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 156 transitions, 1040 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:10,451 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 575 flow [2025-02-06 13:14:10,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=575, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-02-06 13:14:10,452 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2025-02-06 13:14:10,452 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 575 flow [2025-02-06 13:14:10,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:10,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:10,452 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-02-06 13:14:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:14:10,452 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-02-06 13:14:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 21656280, now seen corresponding path program 3 times [2025-02-06 13:14:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027013124] [2025-02-06 13:14:10,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:14:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:10,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:10,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:10,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:14:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027013124] [2025-02-06 13:14:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027013124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:14:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981289192] [2025-02-06 13:14:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:14:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:11,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:14:11,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:14:11,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:11,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 575 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:11,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:11,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:11,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:12,160 INFO L124 PetriNetUnfolderBase]: 2444/5231 cut-off events. [2025-02-06 13:14:12,160 INFO L125 PetriNetUnfolderBase]: For 10092/10104 co-relation queries the response was YES. [2025-02-06 13:14:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15844 conditions, 5231 events. 2444/5231 cut-off events. For 10092/10104 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 35429 event pairs, 722 based on Foata normal form. 0/5149 useless extension candidates. Maximal degree in co-relation 15809. Up to 2963 conditions per place. [2025-02-06 13:14:12,186 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 143 selfloop transitions, 33 changer transitions 0/191 dead transitions. [2025-02-06 13:14:12,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 191 transitions, 1507 flow [2025-02-06 13:14:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:14:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:14:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 403 transitions. [2025-02-06 13:14:12,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 13:14:12,188 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 575 flow. Second operand 13 states and 403 transitions. [2025-02-06 13:14:12,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 191 transitions, 1507 flow [2025-02-06 13:14:12,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1431 flow, removed 38 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:12,208 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 862 flow [2025-02-06 13:14:12,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=862, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-02-06 13:14:12,209 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 61 predicate places. [2025-02-06 13:14:12,209 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 862 flow [2025-02-06 13:14:12,209 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-02-06 13:14:12,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:12,209 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-02-06 13:14:12,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:14:12,210 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-02-06 13:14:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1522983608, now seen corresponding path program 4 times [2025-02-06 13:14:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784871675] [2025-02-06 13:14:12,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:14:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:12,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:14:12,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:12,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:14:12,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784871675] [2025-02-06 13:14:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784871675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:12,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:14:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501538038] [2025-02-06 13:14:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:12,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:14:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:12,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:14:12,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:14:12,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:12,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 862 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:12,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:12,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:12,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:13,959 INFO L124 PetriNetUnfolderBase]: 2752/5862 cut-off events. [2025-02-06 13:14:13,960 INFO L125 PetriNetUnfolderBase]: For 14302/14328 co-relation queries the response was YES. [2025-02-06 13:14:13,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18581 conditions, 5862 events. 2752/5862 cut-off events. For 14302/14328 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40605 event pairs, 481 based on Foata normal form. 16/5806 useless extension candidates. Maximal degree in co-relation 18536. Up to 1802 conditions per place. [2025-02-06 13:14:14,014 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 146 selfloop transitions, 72 changer transitions 0/233 dead transitions. [2025-02-06 13:14:14,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 1924 flow [2025-02-06 13:14:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 13:14:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 13:14:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 493 transitions. [2025-02-06 13:14:14,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-02-06 13:14:14,016 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 862 flow. Second operand 16 states and 493 transitions. [2025-02-06 13:14:14,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 1924 flow [2025-02-06 13:14:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 233 transitions, 1844 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:14,070 INFO L231 Difference]: Finished difference. Result has 133 places, 122 transitions, 1163 flow [2025-02-06 13:14:14,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1163, PETRI_PLACES=133, PETRI_TRANSITIONS=122} [2025-02-06 13:14:14,071 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2025-02-06 13:14:14,072 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 122 transitions, 1163 flow [2025-02-06 13:14:14,072 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-02-06 13:14:14,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:14,072 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-02-06 13:14:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:14:14,072 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -361185041, now seen corresponding path program 2 times [2025-02-06 13:14:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:14,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566090686] [2025-02-06 13:14:14,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:14:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:14,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:14:14,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-02-06 13:14:14,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:14:14,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 13:14:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566090686] [2025-02-06 13:14:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566090686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781438621] [2025-02-06 13:14:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:14,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:14,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:14,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:14,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:14,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:14,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:14,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:14,563 INFO L124 PetriNetUnfolderBase]: 2754/5838 cut-off events. [2025-02-06 13:14:14,563 INFO L125 PetriNetUnfolderBase]: For 17778/17820 co-relation queries the response was YES. [2025-02-06 13:14:14,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19639 conditions, 5838 events. 2754/5838 cut-off events. For 17778/17820 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 40967 event pairs, 1842 based on Foata normal form. 18/5755 useless extension candidates. Maximal degree in co-relation 19587. Up to 4656 conditions per place. [2025-02-06 13:14:14,592 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 105 selfloop transitions, 1 changer transitions 2/121 dead transitions. [2025-02-06 13:14:14,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 121 transitions, 1375 flow [2025-02-06 13:14:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-06 13:14:14,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2025-02-06 13:14:14,593 INFO L175 Difference]: Start difference. First operand has 133 places, 122 transitions, 1163 flow. Second operand 3 states and 90 transitions. [2025-02-06 13:14:14,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 121 transitions, 1375 flow [2025-02-06 13:14:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 1239 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-02-06 13:14:14,636 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 1022 flow [2025-02-06 13:14:14,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2025-02-06 13:14:14,636 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 76 predicate places. [2025-02-06 13:14:14,637 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 1022 flow [2025-02-06 13:14:14,637 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-02-06 13:14:14,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:14,637 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-02-06 13:14:14,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:14:14,637 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -735565878, now seen corresponding path program 1 times [2025-02-06 13:14:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422641768] [2025-02-06 13:14:14,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:14,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:14,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:14,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422641768] [2025-02-06 13:14:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422641768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984163254] [2025-02-06 13:14:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:14,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:14,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:14,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:14,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:14,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:15,027 INFO L124 PetriNetUnfolderBase]: 2706/5522 cut-off events. [2025-02-06 13:14:15,027 INFO L125 PetriNetUnfolderBase]: For 12244/12282 co-relation queries the response was YES. [2025-02-06 13:14:15,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17647 conditions, 5522 events. 2706/5522 cut-off events. For 12244/12282 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 36297 event pairs, 655 based on Foata normal form. 57/5503 useless extension candidates. Maximal degree in co-relation 17598. Up to 3599 conditions per place. [2025-02-06 13:14:15,125 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 111 selfloop transitions, 7 changer transitions 11/141 dead transitions. [2025-02-06 13:14:15,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 141 transitions, 1422 flow [2025-02-06 13:14:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-02-06 13:14:15,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2025-02-06 13:14:15,127 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 1022 flow. Second operand 3 states and 103 transitions. [2025-02-06 13:14:15,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 141 transitions, 1422 flow [2025-02-06 13:14:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1339 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:15,146 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 907 flow [2025-02-06 13:14:15,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-02-06 13:14:15,147 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 74 predicate places. [2025-02-06 13:14:15,147 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 907 flow [2025-02-06 13:14:15,147 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-02-06 13:14:15,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:15,147 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-02-06 13:14:15,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:14:15,148 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-02-06 13:14:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1357388822, now seen corresponding path program 1 times [2025-02-06 13:14:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325251034] [2025-02-06 13:14:15,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:15,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:15,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:15,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:15,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:14:15,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431516314] [2025-02-06 13:14:15,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:15,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:15,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:14:15,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:15,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:15,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:15,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:14:15,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:15,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:14:15,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:14:15,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-02-06 13:14:15,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-02-06 13:14:15,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:15,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:15,552 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:15,586 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:14:15,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:14:15,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:14:15 BasicIcfg [2025-02-06 13:14:15,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:14:15,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:14:15,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:14:15,590 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:14:15,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:03" (3/4) ... [2025-02-06 13:14:15,591 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:14:15,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:14:15,593 INFO L158 Benchmark]: Toolchain (without parser) took 13235.07ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 109.3MB in the beginning and 483.2MB in the end (delta: -373.9MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.35ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 89.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: Boogie Preprocessor took 44.47ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: IcfgBuilder took 461.87ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 45.2MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,593 INFO L158 Benchmark]: TraceAbstraction took 12334.42ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 45.2MB in the beginning and 483.3MB in the end (delta: -438.1MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,594 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 645.9MB. Free memory was 483.3MB in the beginning and 483.2MB in the end (delta: 120.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:14:15,595 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.35ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 89.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.47ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 461.87ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 45.2MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12334.42ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 45.2MB in the beginning and 483.3MB in the end (delta: -438.1MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 645.9MB. Free memory was 483.3MB in the beginning and 483.2MB in the end (delta: 120.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 89 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1148 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1023 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4132 IncrementalHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 6 mSDtfsCounter, 4132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1163occurred in iteration=16, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 467 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:14:15,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 13:14:17,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:17,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 13:14:17,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:17,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:17,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:17,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:17,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:17,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:17,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:17,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:17,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:17,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:17,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:17,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:17,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:17,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:17,609 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-jdk21/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-02-06 13:14:17,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:17,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:17,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:17,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:17,867 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:17,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 13:14:19,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/846a95dd0/d925900c4cf34743a8c225b79a5485b7/FLAG1c2a9dfc3 [2025-02-06 13:14:19,327 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:19,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 13:14:19,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/846a95dd0/d925900c4cf34743a8c225b79a5485b7/FLAG1c2a9dfc3 [2025-02-06 13:14:19,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/846a95dd0/d925900c4cf34743a8c225b79a5485b7 [2025-02-06 13:14:19,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:19,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:19,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:19,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:19,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:19,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffc7004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19, skipping insertion in model container [2025-02-06 13:14:19,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:19,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:19,663 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:19,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:19,733 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:19,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19 WrapperNode [2025-02-06 13:14:19,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:19,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:19,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:19,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:19,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,777 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2025-02-06 13:14:19,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:19,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:19,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:19,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:19,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,807 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-02-06 13:14:19,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:19,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:19,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:19,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:19,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (1/1) ... [2025-02-06 13:14:19,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:19,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:19,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:14:19,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 13:14:19,875 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 13:14:19,875 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 13:14:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 13:14:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:19,877 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:19,981 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:19,982 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:20,202 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-02-06 13:14:20,203 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:20,203 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:20,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:20,371 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:20,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:20 BoogieIcfgContainer [2025-02-06 13:14:20,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:20,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:20,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:20,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:20,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:19" (1/3) ... [2025-02-06 13:14:20,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459131dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:20, skipping insertion in model container [2025-02-06 13:14:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:19" (2/3) ... [2025-02-06 13:14:20,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459131dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:20, skipping insertion in model container [2025-02-06 13:14:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:20" (3/3) ... [2025-02-06 13:14:20,378 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-02-06 13:14:20,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:20,389 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-02-06 13:14:20,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:20,441 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2025-02-06 13:14:20,489 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2025-02-06 13:14:20,491 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:20,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-02-06 13:14:20,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2025-02-06 13:14:20,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2025-02-06 13:14:20,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:20,513 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;@2eab4a5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:20,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 13:14:20,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:20,522 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-02-06 13:14:20,522 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:20,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:20,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:20,522 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-02-06 13:14:20,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -509700733, now seen corresponding path program 1 times [2025-02-06 13:14:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954692020] [2025-02-06 13:14:20,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:20,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:20,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:14:20,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:20,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:20,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:20,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:20,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:14:20,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:20,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:20,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954692020] [2025-02-06 13:14:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954692020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65705375] [2025-02-06 13:14:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:20,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:20,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:20,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:20,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:20,805 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-02-06 13:14:20,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:20,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:20,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:20,949 INFO L124 PetriNetUnfolderBase]: 435/846 cut-off events. [2025-02-06 13:14:20,949 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-06 13:14:20,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 846 events. 435/846 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4438 event pairs, 320 based on Foata normal form. 92/884 useless extension candidates. Maximal degree in co-relation 1494. Up to 691 conditions per place. [2025-02-06 13:14:20,955 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2025-02-06 13:14:20,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2025-02-06 13:14:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 13:14:20,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 13:14:20,967 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2025-02-06 13:14:20,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2025-02-06 13:14:20,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:20,975 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2025-02-06 13:14:20,976 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-02-06 13:14:20,982 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-06 13:14:20,982 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2025-02-06 13:14:20,982 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-02-06 13:14:20,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:20,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:20,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:14:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:21,183 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-02-06 13:14:21,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -509700732, now seen corresponding path program 1 times [2025-02-06 13:14:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334245881] [2025-02-06 13:14:21,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:21,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:21,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:14:21,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:14:21,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:21,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:21,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334245881] [2025-02-06 13:14:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334245881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387373928] [2025-02-06 13:14:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:21,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:21,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:21,413 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-02-06 13:14:21,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:21,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:21,608 INFO L124 PetriNetUnfolderBase]: 778/1474 cut-off events. [2025-02-06 13:14:21,609 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 13:14:21,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1474 events. 778/1474 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7754 event pairs, 264 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 2687. Up to 698 conditions per place. [2025-02-06 13:14:21,615 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-02-06 13:14:21,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2025-02-06 13:14:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-02-06 13:14:21,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2025-02-06 13:14:21,617 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2025-02-06 13:14:21,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2025-02-06 13:14:21,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:21,618 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2025-02-06 13:14:21,619 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-02-06 13:14:21,619 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2025-02-06 13:14:21,619 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2025-02-06 13:14:21,619 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-02-06 13:14:21,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:21,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:21,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:14:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:21,820 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-02-06 13:14:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1784732254, now seen corresponding path program 1 times [2025-02-06 13:14:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056717746] [2025-02-06 13:14:21,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:21,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:21,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:14:21,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:14:21,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:14:21,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:21,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:21,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:14:21,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:21,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:21,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056717746] [2025-02-06 13:14:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056717746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845566418] [2025-02-06 13:14:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:21,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:21,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:21,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:21,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:21,977 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-02-06 13:14:21,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:21,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:21,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:22,276 INFO L124 PetriNetUnfolderBase]: 977/1972 cut-off events. [2025-02-06 13:14:22,276 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-02-06 13:14:22,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1972 events. 977/1972 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10751 event pairs, 196 based on Foata normal form. 74/1989 useless extension candidates. Maximal degree in co-relation 3664. Up to 626 conditions per place. [2025-02-06 13:14:22,284 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-02-06 13:14:22,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2025-02-06 13:14:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-02-06 13:14:22,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2025-02-06 13:14:22,285 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2025-02-06 13:14:22,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2025-02-06 13:14:22,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:22,287 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2025-02-06 13:14:22,287 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-02-06 13:14:22,287 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-02-06 13:14:22,288 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2025-02-06 13:14:22,288 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-02-06 13:14:22,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:22,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:22,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:22,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,492 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-02-06 13:14:22,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1303263971, now seen corresponding path program 1 times [2025-02-06 13:14:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84302449] [2025-02-06 13:14:22,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:22,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:22,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:22,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:14:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:14:22,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:14:22,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:22,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:14:22,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:22,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:22,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84302449] [2025-02-06 13:14:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84302449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726500326] [2025-02-06 13:14:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:22,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:22,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:22,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:22,585 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-02-06 13:14:22,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:22,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:22,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:22,757 INFO L124 PetriNetUnfolderBase]: 982/1958 cut-off events. [2025-02-06 13:14:22,757 INFO L125 PetriNetUnfolderBase]: For 401/421 co-relation queries the response was YES. [2025-02-06 13:14:22,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1958 events. 982/1958 cut-off events. For 401/421 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10953 event pairs, 750 based on Foata normal form. 3/1891 useless extension candidates. Maximal degree in co-relation 3863. Up to 1543 conditions per place. [2025-02-06 13:14:22,764 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 30 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2025-02-06 13:14:22,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 195 flow [2025-02-06 13:14:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-02-06 13:14:22,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-02-06 13:14:22,765 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 91 transitions. [2025-02-06 13:14:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 195 flow [2025-02-06 13:14:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:22,766 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 124 flow [2025-02-06 13:14:22,766 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-02-06 13:14:22,767 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-02-06 13:14:22,767 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 124 flow [2025-02-06 13:14:22,767 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-02-06 13:14:22,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:22,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:22,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,968 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-02-06 13:14:22,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash 570068574, now seen corresponding path program 1 times [2025-02-06 13:14:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711302696] [2025-02-06 13:14:22,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:22,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:22,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:14:23,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:14:23,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:14:23,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:23,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:14:23,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:23,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:23,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711302696] [2025-02-06 13:14:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711302696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602385759] [2025-02-06 13:14:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:23,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:23,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:23,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:23,059 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-02-06 13:14:23,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:23,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:23,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:23,277 INFO L124 PetriNetUnfolderBase]: 1101/2176 cut-off events. [2025-02-06 13:14:23,277 INFO L125 PetriNetUnfolderBase]: For 395/427 co-relation queries the response was YES. [2025-02-06 13:14:23,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 2176 events. 1101/2176 cut-off events. For 395/427 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12306 event pairs, 484 based on Foata normal form. 0/2098 useless extension candidates. Maximal degree in co-relation 4294. Up to 1037 conditions per place. [2025-02-06 13:14:23,285 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 46 selfloop transitions, 4 changer transitions 2/66 dead transitions. [2025-02-06 13:14:23,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 284 flow [2025-02-06 13:14:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-02-06 13:14:23,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-02-06 13:14:23,286 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 124 flow. Second operand 3 states and 110 transitions. [2025-02-06 13:14:23,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 284 flow [2025-02-06 13:14:23,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:23,288 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 149 flow [2025-02-06 13:14:23,288 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-02-06 13:14:23,288 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-02-06 13:14:23,289 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 149 flow [2025-02-06 13:14:23,289 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-02-06 13:14:23,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:23,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:23,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:23,490 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-02-06 13:14:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1732127898, now seen corresponding path program 1 times [2025-02-06 13:14:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065794612] [2025-02-06 13:14:23,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:23,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:23,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:23,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:14:23,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:14:23,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:14:23,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:14:23,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:23,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:23,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:23,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065794612] [2025-02-06 13:14:23,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065794612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:23,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556029664] [2025-02-06 13:14:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:23,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:23,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:23,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:23,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2025-02-06 13:14:23,587 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-02-06 13:14:23,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:23,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2025-02-06 13:14:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:23,813 INFO L124 PetriNetUnfolderBase]: 1020/2022 cut-off events. [2025-02-06 13:14:23,813 INFO L125 PetriNetUnfolderBase]: For 286/298 co-relation queries the response was YES. [2025-02-06 13:14:23,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 2022 events. 1020/2022 cut-off events. For 286/298 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10001 event pairs, 415 based on Foata normal form. 0/1953 useless extension candidates. Maximal degree in co-relation 4009. Up to 1094 conditions per place. [2025-02-06 13:14:23,820 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 41 selfloop transitions, 3 changer transitions 2/61 dead transitions. [2025-02-06 13:14:23,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 267 flow [2025-02-06 13:14:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-02-06 13:14:23,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2025-02-06 13:14:23,821 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 149 flow. Second operand 3 states and 105 transitions. [2025-02-06 13:14:23,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 267 flow [2025-02-06 13:14:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:23,825 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 153 flow [2025-02-06 13:14:23,825 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-02-06 13:14:23,825 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-02-06 13:14:23,825 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 153 flow [2025-02-06 13:14:23,825 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-02-06 13:14:23,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:23,825 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-02-06 13:14:23,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:14:24,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:24,026 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-02-06 13:14:24,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 48289940, now seen corresponding path program 1 times [2025-02-06 13:14:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506119130] [2025-02-06 13:14:24,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:24,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:24,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:24,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:24,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:14:24,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:14:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:14:24,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:24,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:24,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:14:24,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:24,129 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-02-06 13:14:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:24,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:24,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506119130] [2025-02-06 13:14:24,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506119130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:24,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:24,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702686872] [2025-02-06 13:14:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:24,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:24,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:24,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:24,164 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-02-06 13:14:24,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:24,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:24,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:24,324 INFO L124 PetriNetUnfolderBase]: 663/1504 cut-off events. [2025-02-06 13:14:24,324 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-02-06 13:14:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 1504 events. 663/1504 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7122 event pairs, 220 based on Foata normal form. 76/1551 useless extension candidates. Maximal degree in co-relation 2945. Up to 618 conditions per place. [2025-02-06 13:14:24,330 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-06 13:14:24,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 257 flow [2025-02-06 13:14:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-06 13:14:24,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-02-06 13:14:24,331 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 153 flow. Second operand 3 states and 104 transitions. [2025-02-06 13:14:24,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 257 flow [2025-02-06 13:14:24,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:24,333 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 155 flow [2025-02-06 13:14:24,333 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-02-06 13:14:24,333 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-02-06 13:14:24,333 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 155 flow [2025-02-06 13:14:24,334 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-02-06 13:14:24,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:24,334 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-02-06 13:14:24,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:14:24,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:24,534 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-02-06 13:14:24,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1177874003, now seen corresponding path program 1 times [2025-02-06 13:14:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:24,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253034621] [2025-02-06 13:14:24,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:24,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:24,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:14:24,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:14:24,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:14:24,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:24,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:24,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:14:24,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:24,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:24,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253034621] [2025-02-06 13:14:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253034621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:24,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545359060] [2025-02-06 13:14:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:24,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:24,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:24,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:24,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:24,877 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-02-06 13:14:24,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:24,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:24,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:25,230 INFO L124 PetriNetUnfolderBase]: 1336/2886 cut-off events. [2025-02-06 13:14:25,230 INFO L125 PetriNetUnfolderBase]: For 637/641 co-relation queries the response was YES. [2025-02-06 13:14:25,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 2886 events. 1336/2886 cut-off events. For 637/641 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 15725 event pairs, 724 based on Foata normal form. 0/2784 useless extension candidates. Maximal degree in co-relation 6035. Up to 1099 conditions per place. [2025-02-06 13:14:25,238 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 78 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-06 13:14:25,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 479 flow [2025-02-06 13:14:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-02-06 13:14:25,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681034482758621 [2025-02-06 13:14:25,239 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 155 flow. Second operand 4 states and 155 transitions. [2025-02-06 13:14:25,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 479 flow [2025-02-06 13:14:25,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:25,241 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-02-06 13:14:25,242 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-02-06 13:14:25,242 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-06 13:14:25,242 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-02-06 13:14:25,242 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-02-06 13:14:25,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:25,242 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-02-06 13:14:25,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:25,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:25,447 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-02-06 13:14:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1671491468, now seen corresponding path program 1 times [2025-02-06 13:14:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578508908] [2025-02-06 13:14:25,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:25,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:25,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:25,450 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:25,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:14:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:25,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:25,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:25,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:14:25,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:25,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:25,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578508908] [2025-02-06 13:14:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578508908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642646231] [2025-02-06 13:14:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:25,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:25,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:25,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2025-02-06 13:14:25,676 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-02-06 13:14:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:25,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2025-02-06 13:14:25,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:25,896 INFO L124 PetriNetUnfolderBase]: 937/2051 cut-off events. [2025-02-06 13:14:25,897 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-02-06 13:14:25,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 2051 events. 937/2051 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 10076 event pairs, 422 based on Foata normal form. 7/2015 useless extension candidates. Maximal degree in co-relation 4162. Up to 1045 conditions per place. [2025-02-06 13:14:25,902 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2025-02-06 13:14:25,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 356 flow [2025-02-06 13:14:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-02-06 13:14:25,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2025-02-06 13:14:25,903 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 4 states and 142 transitions. [2025-02-06 13:14:25,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 356 flow [2025-02-06 13:14:25,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:25,905 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 177 flow [2025-02-06 13:14:25,905 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-02-06 13:14:25,905 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-02-06 13:14:25,905 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 177 flow [2025-02-06 13:14:25,905 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-02-06 13:14:25,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:25,906 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-02-06 13:14:25,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:26,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:26,106 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-02-06 13:14:26,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -3594672, now seen corresponding path program 1 times [2025-02-06 13:14:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481873008] [2025-02-06 13:14:26,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:26,109 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:26,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:14:26,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:26,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:26,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:14:26,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:26,387 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-02-06 13:14:26,541 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-02-06 13:14:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:26,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:26,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481873008] [2025-02-06 13:14:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481873008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:26,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:14:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351173690] [2025-02-06 13:14:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:14:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:26,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:14:26,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:14:26,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:26,695 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-02-06 13:14:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:27,262 INFO L124 PetriNetUnfolderBase]: 1096/2372 cut-off events. [2025-02-06 13:14:27,263 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2025-02-06 13:14:27,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 2372 events. 1096/2372 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12227 event pairs, 450 based on Foata normal form. 27/2356 useless extension candidates. Maximal degree in co-relation 4920. Up to 1398 conditions per place. [2025-02-06 13:14:27,296 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 81 selfloop transitions, 14 changer transitions 17/127 dead transitions. [2025-02-06 13:14:27,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 621 flow [2025-02-06 13:14:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:14:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:14:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 322 transitions. [2025-02-06 13:14:27,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5047021943573667 [2025-02-06 13:14:27,299 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 177 flow. Second operand 11 states and 322 transitions. [2025-02-06 13:14:27,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 621 flow [2025-02-06 13:14:27,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 127 transitions, 612 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:27,303 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 289 flow [2025-02-06 13:14:27,303 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-02-06 13:14:27,304 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-02-06 13:14:27,304 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 289 flow [2025-02-06 13:14:27,304 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-02-06 13:14:27,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:27,304 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-02-06 13:14:27,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:14:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:27,508 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-02-06 13:14:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1497749040, now seen corresponding path program 2 times [2025-02-06 13:14:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633607387] [2025-02-06 13:14:27,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:14:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:27,512 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:27,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:14:27,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:27,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:27,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:14:27,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:27,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:14:27,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:27,788 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-02-06 13:14:27,958 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-02-06 13:14:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:27,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:27,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633607387] [2025-02-06 13:14:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633607387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:14:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179604740] [2025-02-06 13:14:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:27,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:14:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:27,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:14:27,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:14:28,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:28,111 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-02-06 13:14:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:28,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:28,712 INFO L124 PetriNetUnfolderBase]: 1235/2687 cut-off events. [2025-02-06 13:14:28,712 INFO L125 PetriNetUnfolderBase]: For 2661/2661 co-relation queries the response was YES. [2025-02-06 13:14:28,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 2687 events. 1235/2687 cut-off events. For 2661/2661 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14480 event pairs, 495 based on Foata normal form. 31/2671 useless extension candidates. Maximal degree in co-relation 7258. Up to 1664 conditions per place. [2025-02-06 13:14:28,720 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 89 selfloop transitions, 20 changer transitions 10/134 dead transitions. [2025-02-06 13:14:28,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 843 flow [2025-02-06 13:14:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:14:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:14:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 320 transitions. [2025-02-06 13:14:28,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5015673981191222 [2025-02-06 13:14:28,722 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 289 flow. Second operand 11 states and 320 transitions. [2025-02-06 13:14:28,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 843 flow [2025-02-06 13:14:28,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 828 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:28,728 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 500 flow [2025-02-06 13:14:28,728 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-02-06 13:14:28,728 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-02-06 13:14:28,728 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 500 flow [2025-02-06 13:14:28,729 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-02-06 13:14:28,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:28,729 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-02-06 13:14:28,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:28,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:28,930 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-02-06 13:14:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1922311674, now seen corresponding path program 3 times [2025-02-06 13:14:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606415538] [2025-02-06 13:14:28,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:14:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:28,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:28,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 13:14:28,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:14:29,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:29,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:14:29,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:29,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:14:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:29,206 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-02-06 13:14:29,335 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-02-06 13:14:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:29,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:29,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606415538] [2025-02-06 13:14:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606415538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:14:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550669865] [2025-02-06 13:14:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:29,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:14:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:29,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:14:29,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:14:29,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:29,486 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-02-06 13:14:29,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:29,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:29,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:30,208 INFO L124 PetriNetUnfolderBase]: 1395/3046 cut-off events. [2025-02-06 13:14:30,208 INFO L125 PetriNetUnfolderBase]: For 6665/6669 co-relation queries the response was YES. [2025-02-06 13:14:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 3046 events. 1395/3046 cut-off events. For 6665/6669 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16901 event pairs, 466 based on Foata normal form. 13/3025 useless extension candidates. Maximal degree in co-relation 9330. Up to 1934 conditions per place. [2025-02-06 13:14:30,226 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 108 selfloop transitions, 20 changer transitions 4/147 dead transitions. [2025-02-06 13:14:30,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1088 flow [2025-02-06 13:14:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:14:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:14:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 317 transitions. [2025-02-06 13:14:30,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49686520376175547 [2025-02-06 13:14:30,235 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 500 flow. Second operand 11 states and 317 transitions. [2025-02-06 13:14:30,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1088 flow [2025-02-06 13:14:30,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 147 transitions, 1014 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:30,258 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 631 flow [2025-02-06 13:14:30,258 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-02-06 13:14:30,258 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2025-02-06 13:14:30,258 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 631 flow [2025-02-06 13:14:30,259 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-02-06 13:14:30,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:30,259 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-02-06 13:14:30,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 13:14:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:30,459 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-02-06 13:14:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1745207160, now seen corresponding path program 4 times [2025-02-06 13:14:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371834211] [2025-02-06 13:14:30,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:14:30,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:30,462 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:30,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 13:14:30,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:14:30,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:14:30,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:14:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:30,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:14:30,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:30,762 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-02-06 13:14:30,921 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-02-06 13:14:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:30,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:30,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:14:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371834211] [2025-02-06 13:14:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371834211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:14:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402241355] [2025-02-06 13:14:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:14:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:14:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:14:30,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:14:31,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2025-02-06 13:14:31,068 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-02-06 13:14:31,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:31,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2025-02-06 13:14:31,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:31,928 INFO L124 PetriNetUnfolderBase]: 1539/3346 cut-off events. [2025-02-06 13:14:31,929 INFO L125 PetriNetUnfolderBase]: For 8026/8036 co-relation queries the response was YES. [2025-02-06 13:14:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10567 conditions, 3346 events. 1539/3346 cut-off events. For 8026/8036 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 19092 event pairs, 316 based on Foata normal form. 17/3329 useless extension candidates. Maximal degree in co-relation 10526. Up to 1245 conditions per place. [2025-02-06 13:14:31,940 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 97 selfloop transitions, 52 changer transitions 11/175 dead transitions. [2025-02-06 13:14:31,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1341 flow [2025-02-06 13:14:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:14:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:14:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 397 transitions. [2025-02-06 13:14:31,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48891625615763545 [2025-02-06 13:14:31,945 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 631 flow. Second operand 14 states and 397 transitions. [2025-02-06 13:14:31,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1341 flow [2025-02-06 13:14:31,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 175 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:31,961 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 849 flow [2025-02-06 13:14:31,961 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-02-06 13:14:31,962 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2025-02-06 13:14:31,962 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 849 flow [2025-02-06 13:14:31,962 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-02-06 13:14:31,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:31,965 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-02-06 13:14:31,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:32,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:32,166 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-02-06 13:14:32,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -639148054, now seen corresponding path program 1 times [2025-02-06 13:14:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:14:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448094107] [2025-02-06 13:14:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:32,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:32,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:32,169 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:32,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 13:14:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:32,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:14:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 13:14:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 13:14:32,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:32,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:14:32,321 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 13:14:32,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:14:32,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-02-06 13:14:32,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-02-06 13:14:32,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 13:14:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:32,524 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:32,553 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:14:32,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:14:32,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:14:32 BasicIcfg [2025-02-06 13:14:32,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:14:32,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:14:32,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:14:32,561 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:14:32,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:20" (3/4) ... [2025-02-06 13:14:32,562 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:14:32,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:14:32,563 INFO L158 Benchmark]: Toolchain (without parser) took 13203.44ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 91.7MB in the beginning and 158.1MB in the end (delta: -66.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: CDTParser took 4.55ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 37.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.01ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 69.9MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.38ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: Boogie Preprocessor took 47.88ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: IcfgBuilder took 545.52ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 61.0MB in the end (delta: 4.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-02-06 13:14:32,564 INFO L158 Benchmark]: TraceAbstraction took 12187.34ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 60.2MB in the beginning and 158.1MB in the end (delta: -97.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-02-06 13:14:32,565 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 260.0MB. Free memory was 158.1MB in the beginning and 158.1MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:14:32,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.55ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 37.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.01ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 69.9MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.38ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.88ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.52ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 61.0MB in the end (delta: 4.2MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12187.34ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 60.2MB in the beginning and 158.1MB in the end (delta: -97.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 260.0MB. Free memory was 158.1MB in the beginning and 158.1MB in the end (delta: 21.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, 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.1s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 2.8s 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.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:14:32,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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