./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/stack_longest-2.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 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:37:41,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:37:41,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:37:41,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:37:41,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:37:41,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:37:41,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:37:41,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:37:41,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:37:41,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:37:41,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:37:41,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:37:41,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:37:41,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:37:41,674 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:37:41,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:37:41,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:37:41,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:41,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:41,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:41,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:37:41,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:37:41,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:37:41,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:37:41,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:37:41,678 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 -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2025-01-10 00:37:41,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:37:41,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:37:41,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:37:41,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:37:41,940 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:37:41,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-2.i [2025-01-10 00:37:43,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8faafa2b/dbccb39837904e729bf4dec455f1c58f/FLAG523141695 [2025-01-10 00:37:43,437 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:37:43,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2025-01-10 00:37:43,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8faafa2b/dbccb39837904e729bf4dec455f1c58f/FLAG523141695 [2025-01-10 00:37:43,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8faafa2b/dbccb39837904e729bf4dec455f1c58f [2025-01-10 00:37:43,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:37:43,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:37:43,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:43,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:37:43,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:37:43,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:43" (1/1) ... [2025-01-10 00:37:43,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f6bd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:43, skipping insertion in model container [2025-01-10 00:37:43,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:43" (1/1) ... [2025-01-10 00:37:43,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:37:43,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:43,976 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:37:44,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:44,119 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:37:44,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44 WrapperNode [2025-01-10 00:37:44,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:44,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:44,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:37:44,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:37:44,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,208 INFO L138 Inliner]: procedures = 277, calls = 831, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 943 [2025-01-10 00:37:44,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:44,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:37:44,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:37:44,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:37:44,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,237 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 00:37:44,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:37:44,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:37:44,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:37:44,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:37:44,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (1/1) ... [2025-01-10 00:37:44,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:44,291 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-01-10 00:37:44,295 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-01-10 00:37:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:37:44,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:37:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:37:44,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:37:44,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:37:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:37:44,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:37:44,311 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:37:44,414 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:37:44,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:37:45,249 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:37:45,250 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:37:54,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:37:54,351 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:37:54,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:54 BoogieIcfgContainer [2025-01-10 00:37:54,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:37:54,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:37:54,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:37:54,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:37:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:37:43" (1/3) ... [2025-01-10 00:37:54,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642aee8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:54, skipping insertion in model container [2025-01-10 00:37:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:44" (2/3) ... [2025-01-10 00:37:54,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642aee8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:54, skipping insertion in model container [2025-01-10 00:37:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:54" (3/3) ... [2025-01-10 00:37:54,357 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-01-10 00:37:54,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:37:54,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 46 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-10 00:37:54,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:37:54,445 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:37:54,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 122 flow [2025-01-10 00:37:54,510 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-01-10 00:37:54,512 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:37:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 9/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-01-10 00:37:54,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 54 transitions, 122 flow [2025-01-10 00:37:54,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 51 transitions, 114 flow [2025-01-10 00:37:54,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:54,537 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;@1910642b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:54,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 00:37:54,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:54,558 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-01-10 00:37:54,559 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:37:54,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:54,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:54,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1599147722, now seen corresponding path program 1 times [2025-01-10 00:37:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857393397] [2025-01-10 00:37:54,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:54,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:54,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:55,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857393397] [2025-01-10 00:37:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857393397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:55,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:55,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003390634] [2025-01-10 00:37:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:55,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:55,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:55,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:55,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-10 00:37:55,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:55,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:55,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:55,454 INFO L124 PetriNetUnfolderBase]: 459/863 cut-off events. [2025-01-10 00:37:55,454 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 00:37:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 863 events. 459/863 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4282 event pairs, 245 based on Foata normal form. 90/827 useless extension candidates. Maximal degree in co-relation 1557. Up to 520 conditions per place. [2025-01-10 00:37:55,461 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 43 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 00:37:55,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 225 flow [2025-01-10 00:37:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 00:37:55,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-01-10 00:37:55,481 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 114 flow. Second operand 4 states and 113 transitions. [2025-01-10 00:37:55,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 225 flow [2025-01-10 00:37:55,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:37:55,493 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 98 flow [2025-01-10 00:37:55,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-01-10 00:37:55,501 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-01-10 00:37:55,501 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 98 flow [2025-01-10 00:37:55,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-10 00:37:55,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:55,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:37:55,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1599147721, now seen corresponding path program 1 times [2025-01-10 00:37:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245732093] [2025-01-10 00:37:55,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:55,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245732093] [2025-01-10 00:37:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245732093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915996500] [2025-01-10 00:37:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:56,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:56,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:56,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:56,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-01-10 00:37:56,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:56,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:56,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:56,349 INFO L124 PetriNetUnfolderBase]: 574/1065 cut-off events. [2025-01-10 00:37:56,349 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 00:37:56,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 1065 events. 574/1065 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5035 event pairs, 179 based on Foata normal form. 9/927 useless extension candidates. Maximal degree in co-relation 695. Up to 755 conditions per place. [2025-01-10 00:37:56,355 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 59 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-01-10 00:37:56,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 293 flow [2025-01-10 00:37:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-01-10 00:37:56,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2025-01-10 00:37:56,356 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 98 flow. Second operand 5 states and 143 transitions. [2025-01-10 00:37:56,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 293 flow [2025-01-10 00:37:56,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 285 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:56,359 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 128 flow [2025-01-10 00:37:56,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-01-10 00:37:56,359 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-01-10 00:37:56,359 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 128 flow [2025-01-10 00:37:56,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-01-10 00:37:56,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:56,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:56,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:37:56,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:56,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -460140676, now seen corresponding path program 1 times [2025-01-10 00:37:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652237536] [2025-01-10 00:37:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:56,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:37:56,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:37:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652237536] [2025-01-10 00:37:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652237536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327030957] [2025-01-10 00:37:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:56,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:56,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-01-10 00:37:56,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:56,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:56,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:56,740 INFO L124 PetriNetUnfolderBase]: 823/1512 cut-off events. [2025-01-10 00:37:56,741 INFO L125 PetriNetUnfolderBase]: For 255/258 co-relation queries the response was YES. [2025-01-10 00:37:56,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1512 events. 823/1512 cut-off events. For 255/258 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7718 event pairs, 363 based on Foata normal form. 1/1368 useless extension candidates. Maximal degree in co-relation 1126. Up to 857 conditions per place. [2025-01-10 00:37:56,748 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 68 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-01-10 00:37:56,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 370 flow [2025-01-10 00:37:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-01-10 00:37:56,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 00:37:56,750 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-01-10 00:37:56,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 370 flow [2025-01-10 00:37:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:56,752 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 159 flow [2025-01-10 00:37:56,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-01-10 00:37:56,752 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-01-10 00:37:56,753 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 159 flow [2025-01-10 00:37:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-01-10 00:37:56,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:56,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:56,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:37:56,753 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-01-10 00:37:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash -22432929, now seen corresponding path program 1 times [2025-01-10 00:37:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:56,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795314107] [2025-01-10 00:37:56,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:56,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:56,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:37:56,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:37:56,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:56,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795314107] [2025-01-10 00:37:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795314107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:56,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:56,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574716109] [2025-01-10 00:37:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:56,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:56,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:56,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:56,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:56,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-10 00:37:56,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:56,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:56,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:57,038 INFO L124 PetriNetUnfolderBase]: 957/1712 cut-off events. [2025-01-10 00:37:57,039 INFO L125 PetriNetUnfolderBase]: For 518/522 co-relation queries the response was YES. [2025-01-10 00:37:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 1712 events. 957/1712 cut-off events. For 518/522 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8836 event pairs, 395 based on Foata normal form. 14/1573 useless extension candidates. Maximal degree in co-relation 1265. Up to 1191 conditions per place. [2025-01-10 00:37:57,048 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-10 00:37:57,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 328 flow [2025-01-10 00:37:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 00:37:57,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-01-10 00:37:57,049 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 159 flow. Second operand 3 states and 103 transitions. [2025-01-10 00:37:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 328 flow [2025-01-10 00:37:57,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:57,054 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 168 flow [2025-01-10 00:37:57,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-01-10 00:37:57,054 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-01-10 00:37:57,054 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 168 flow [2025-01-10 00:37:57,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-01-10 00:37:57,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:57,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:57,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:37:57,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -975104607, now seen corresponding path program 1 times [2025-01-10 00:37:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:57,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832271114] [2025-01-10 00:37:57,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:57,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:57,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:57,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:57,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:57,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832271114] [2025-01-10 00:37:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832271114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996259892] [2025-01-10 00:37:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:57,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:57,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:57,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-10 00:37:57,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:57,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:57,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:57,417 INFO L124 PetriNetUnfolderBase]: 499/1033 cut-off events. [2025-01-10 00:37:57,417 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-01-10 00:37:57,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 1033 events. 499/1033 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4777 event pairs, 105 based on Foata normal form. 60/1021 useless extension candidates. Maximal degree in co-relation 918. Up to 634 conditions per place. [2025-01-10 00:37:57,422 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 45 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-01-10 00:37:57,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 300 flow [2025-01-10 00:37:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-01-10 00:37:57,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-01-10 00:37:57,424 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 168 flow. Second operand 3 states and 91 transitions. [2025-01-10 00:37:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 300 flow [2025-01-10 00:37:57,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 292 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:57,428 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 170 flow [2025-01-10 00:37:57,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-01-10 00:37:57,429 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-01-10 00:37:57,429 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 170 flow [2025-01-10 00:37:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-10 00:37:57,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:57,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:37:57,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1196822517, now seen corresponding path program 1 times [2025-01-10 00:37:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419577556] [2025-01-10 00:37:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:57,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:57,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:57,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419577556] [2025-01-10 00:37:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419577556] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296822969] [2025-01-10 00:37:57,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:57,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:57,916 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-01-10 00:37:57,918 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-01-10 00:37:57,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:58,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:58,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:58,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:58,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 00:37:58,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:58,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:58,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296822969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:58,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 00:37:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997395607] [2025-01-10 00:37:58,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:58,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:37:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:58,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:37:58,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:37:58,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-01-10 00:37:58,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 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-01-10 00:37:58,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:58,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-01-10 00:37:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:59,463 INFO L124 PetriNetUnfolderBase]: 1740/3509 cut-off events. [2025-01-10 00:37:59,464 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-01-10 00:37:59,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8220 conditions, 3509 events. 1740/3509 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19700 event pairs, 262 based on Foata normal form. 54/3328 useless extension candidates. Maximal degree in co-relation 2561. Up to 699 conditions per place. [2025-01-10 00:37:59,479 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 194 selfloop transitions, 26 changer transitions 0/231 dead transitions. [2025-01-10 00:37:59,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 231 transitions, 1170 flow [2025-01-10 00:37:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:37:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 00:37:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2025-01-10 00:37:59,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2025-01-10 00:37:59,482 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 170 flow. Second operand 15 states and 425 transitions. [2025-01-10 00:37:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 231 transitions, 1170 flow [2025-01-10 00:37:59,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 231 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:59,491 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 417 flow [2025-01-10 00:37:59,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-10 00:37:59,492 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2025-01-10 00:37:59,493 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 417 flow [2025-01-10 00:37:59,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 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-01-10 00:37:59,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:59,493 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] [2025-01-10 00:37:59,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:37:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:59,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:37:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1569621190, now seen corresponding path program 1 times [2025-01-10 00:37:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844517531] [2025-01-10 00:37:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:59,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:37:59,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:37:59,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844517531] [2025-01-10 00:37:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844517531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042057813] [2025-01-10 00:37:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:59,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:59,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:59,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:59,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-01-10 00:37:59,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:00,162 INFO L124 PetriNetUnfolderBase]: 1695/3429 cut-off events. [2025-01-10 00:38:00,162 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-01-10 00:38:00,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 3429 events. 1695/3429 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 19705 event pairs, 1170 based on Foata normal form. 0/3315 useless extension candidates. Maximal degree in co-relation 7329. Up to 2532 conditions per place. [2025-01-10 00:38:00,183 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 64 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 00:38:00,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 566 flow [2025-01-10 00:38:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 00:38:00,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 00:38:00,185 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 417 flow. Second operand 4 states and 96 transitions. [2025-01-10 00:38:00,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 566 flow [2025-01-10 00:38:00,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 556 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:00,199 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 411 flow [2025-01-10 00:38:00,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-01-10 00:38:00,202 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2025-01-10 00:38:00,204 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 411 flow [2025-01-10 00:38:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-01-10 00:38:00,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:00,204 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] [2025-01-10 00:38:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:00,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:00,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1569621189, now seen corresponding path program 1 times [2025-01-10 00:38:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875848804] [2025-01-10 00:38:00,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:00,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:38:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:38:00,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875848804] [2025-01-10 00:38:00,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875848804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:00,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:00,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:38:00,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447665488] [2025-01-10 00:38:00,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:38:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:00,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:38:00,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:38:00,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:38:00,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-01-10 00:38:00,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:00,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:38:00,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:00,990 INFO L124 PetriNetUnfolderBase]: 1847/3723 cut-off events. [2025-01-10 00:38:00,991 INFO L125 PetriNetUnfolderBase]: For 2271/2271 co-relation queries the response was YES. [2025-01-10 00:38:01,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9657 conditions, 3723 events. 1847/3723 cut-off events. For 2271/2271 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 21453 event pairs, 510 based on Foata normal form. 0/3573 useless extension candidates. Maximal degree in co-relation 8154. Up to 2690 conditions per place. [2025-01-10 00:38:01,019 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 100 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2025-01-10 00:38:01,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 118 transitions, 798 flow [2025-01-10 00:38:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:38:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:38:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2025-01-10 00:38:01,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-01-10 00:38:01,020 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 411 flow. Second operand 6 states and 168 transitions. [2025-01-10 00:38:01,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 118 transitions, 798 flow [2025-01-10 00:38:01,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 788 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:38:01,031 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 472 flow [2025-01-10 00:38:01,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-01-10 00:38:01,033 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2025-01-10 00:38:01,033 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 472 flow [2025-01-10 00:38:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-01-10 00:38:01,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:01,034 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-01-10 00:38:01,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:38:01,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:01,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 788223513, now seen corresponding path program 1 times [2025-01-10 00:38:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590946206] [2025-01-10 00:38:01,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:01,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:01,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:38:01,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:38:01,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590946206] [2025-01-10 00:38:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590946206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:01,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37620916] [2025-01-10 00:38:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:01,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:01,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:01,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:01,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:38:01,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-10 00:38:01,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:01,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:38:01,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:01,542 INFO L124 PetriNetUnfolderBase]: 2725/5699 cut-off events. [2025-01-10 00:38:01,542 INFO L125 PetriNetUnfolderBase]: For 3977/3977 co-relation queries the response was YES. [2025-01-10 00:38:01,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14602 conditions, 5699 events. 2725/5699 cut-off events. For 3977/3977 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 38030 event pairs, 1359 based on Foata normal form. 137/5634 useless extension candidates. Maximal degree in co-relation 12588. Up to 3244 conditions per place. [2025-01-10 00:38:01,579 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 122 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-01-10 00:38:01,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1106 flow [2025-01-10 00:38:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 00:38:01,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-01-10 00:38:01,581 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 472 flow. Second operand 3 states and 104 transitions. [2025-01-10 00:38:01,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1106 flow [2025-01-10 00:38:01,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1094 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:01,595 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 477 flow [2025-01-10 00:38:01,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2025-01-10 00:38:01,596 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-01-10 00:38:01,596 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 477 flow [2025-01-10 00:38:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-10 00:38:01,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:01,596 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] [2025-01-10 00:38:01,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:38:01,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:01,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -887844999, now seen corresponding path program 1 times [2025-01-10 00:38:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384336553] [2025-01-10 00:38:01,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:01,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:38:01,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:38:01,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384336553] [2025-01-10 00:38:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384336553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:38:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130459200] [2025-01-10 00:38:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:38:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:02,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:38:02,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:38:02,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:38:02,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 477 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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-01-10 00:38:02,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:02,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:38:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:03,617 INFO L124 PetriNetUnfolderBase]: 3462/7028 cut-off events. [2025-01-10 00:38:03,617 INFO L125 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2025-01-10 00:38:03,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19738 conditions, 7028 events. 3462/7028 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 44842 event pairs, 786 based on Foata normal form. 0/6808 useless extension candidates. Maximal degree in co-relation 16163. Up to 3938 conditions per place. [2025-01-10 00:38:03,669 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 165 selfloop transitions, 12 changer transitions 0/189 dead transitions. [2025-01-10 00:38:03,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 189 transitions, 1341 flow [2025-01-10 00:38:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:38:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:38:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 319 transitions. [2025-01-10 00:38:03,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49228395061728397 [2025-01-10 00:38:03,671 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 477 flow. Second operand 12 states and 319 transitions. [2025-01-10 00:38:03,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 189 transitions, 1341 flow [2025-01-10 00:38:03,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:03,694 INFO L231 Difference]: Finished difference. Result has 102 places, 83 transitions, 525 flow [2025-01-10 00:38:03,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=525, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2025-01-10 00:38:03,695 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 53 predicate places. [2025-01-10 00:38:03,696 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 83 transitions, 525 flow [2025-01-10 00:38:03,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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-01-10 00:38:03,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:03,696 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, 1, 1] [2025-01-10 00:38:03,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:38:03,696 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-01-10 00:38:03,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash 371197537, now seen corresponding path program 1 times [2025-01-10 00:38:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:03,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819278789] [2025-01-10 00:38:03,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:38:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:38:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:03,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819278789] [2025-01-10 00:38:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819278789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:38:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368510952] [2025-01-10 00:38:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:03,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:03,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:03,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:03,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:38:03,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 83 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-01-10 00:38:03,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:03,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:38:03,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:04,493 INFO L124 PetriNetUnfolderBase]: 4935/10402 cut-off events. [2025-01-10 00:38:04,494 INFO L125 PetriNetUnfolderBase]: For 10312/10312 co-relation queries the response was YES. [2025-01-10 00:38:04,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29184 conditions, 10402 events. 4935/10402 cut-off events. For 10312/10312 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 76288 event pairs, 1723 based on Foata normal form. 307/10394 useless extension candidates. Maximal degree in co-relation 24264. Up to 4409 conditions per place. [2025-01-10 00:38:04,597 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 189 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2025-01-10 00:38:04,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 1780 flow [2025-01-10 00:38:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-01-10 00:38:04,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:38:04,602 INFO L175 Difference]: Start difference. First operand has 102 places, 83 transitions, 525 flow. Second operand 4 states and 144 transitions. [2025-01-10 00:38:04,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 1780 flow [2025-01-10 00:38:04,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 204 transitions, 1721 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 00:38:04,654 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 519 flow [2025-01-10 00:38:04,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2025-01-10 00:38:04,654 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2025-01-10 00:38:04,655 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 519 flow [2025-01-10 00:38:04,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-01-10 00:38:04,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:04,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:38:04,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1877354181, now seen corresponding path program 1 times [2025-01-10 00:38:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315480283] [2025-01-10 00:38:04,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:04,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:38:04,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:38:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315480283] [2025-01-10 00:38:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315480283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202199734] [2025-01-10 00:38:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:05,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:05,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:05,037 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-01-10 00:38:05,039 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-01-10 00:38:05,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:38:05,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:38:05,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:05,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:05,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:38:05,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202199734] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:05,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 00:38:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180334619] [2025-01-10 00:38:05,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:05,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:38:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:05,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:38:05,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:38:05,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-01-10 00:38:05,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 519 flow. Second operand has 17 states, 17 states have (on average 18.41176470588235) internal successors, (313), 17 states have internal predecessors, (313), 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-01-10 00:38:05,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:05,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-01-10 00:38:05,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:08,053 INFO L124 PetriNetUnfolderBase]: 10387/20856 cut-off events. [2025-01-10 00:38:08,053 INFO L125 PetriNetUnfolderBase]: For 25778/25786 co-relation queries the response was YES. [2025-01-10 00:38:08,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62308 conditions, 20856 events. 10387/20856 cut-off events. For 25778/25786 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 160030 event pairs, 1566 based on Foata normal form. 225/20384 useless extension candidates. Maximal degree in co-relation 47591. Up to 3457 conditions per place. [2025-01-10 00:38:08,144 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 333 selfloop transitions, 57 changer transitions 0/400 dead transitions. [2025-01-10 00:38:08,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 400 transitions, 2862 flow [2025-01-10 00:38:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:38:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:38:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 590 transitions. [2025-01-10 00:38:08,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-01-10 00:38:08,149 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 519 flow. Second operand 20 states and 590 transitions. [2025-01-10 00:38:08,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 400 transitions, 2862 flow [2025-01-10 00:38:08,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 400 transitions, 2807 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:08,211 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 1025 flow [2025-01-10 00:38:08,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1025, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-01-10 00:38:08,212 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 79 predicate places. [2025-01-10 00:38:08,212 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 1025 flow [2025-01-10 00:38:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.41176470588235) internal successors, (313), 17 states have internal predecessors, (313), 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-01-10 00:38:08,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:08,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:08,221 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-01-10 00:38:08,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:08,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash -149367547, now seen corresponding path program 1 times [2025-01-10 00:38:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558737455] [2025-01-10 00:38:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:38:08,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:38:08,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558737455] [2025-01-10 00:38:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558737455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650728919] [2025-01-10 00:38:09,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:09,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:09,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:09,461 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-01-10 00:38:09,465 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-01-10 00:38:09,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:38:09,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:38:09,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:09,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:38:09,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:09,895 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 25 treesize of output 1 [2025-01-10 00:38:09,999 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 80 treesize of output 32 [2025-01-10 00:38:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:10,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:38:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650728919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:10,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:38:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2025-01-10 00:38:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676322272] [2025-01-10 00:38:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:10,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:38:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:10,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:38:10,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:38:10,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:38:10,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 1025 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-01-10 00:38:10,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:10,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:38:10,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:13,919 INFO L124 PetriNetUnfolderBase]: 14547/29206 cut-off events. [2025-01-10 00:38:13,920 INFO L125 PetriNetUnfolderBase]: For 52879/52879 co-relation queries the response was YES. [2025-01-10 00:38:14,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94054 conditions, 29206 events. 14547/29206 cut-off events. For 52879/52879 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 241173 event pairs, 2010 based on Foata normal form. 0/28357 useless extension candidates. Maximal degree in co-relation 87540. Up to 5948 conditions per place. [2025-01-10 00:38:14,208 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 164 selfloop transitions, 140 changer transitions 0/316 dead transitions. [2025-01-10 00:38:14,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 316 transitions, 2799 flow [2025-01-10 00:38:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:38:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:38:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 420 transitions. [2025-01-10 00:38:14,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-01-10 00:38:14,210 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 1025 flow. Second operand 17 states and 420 transitions. [2025-01-10 00:38:14,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 316 transitions, 2799 flow [2025-01-10 00:38:14,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 316 transitions, 2642 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-01-10 00:38:14,444 INFO L231 Difference]: Finished difference. Result has 145 places, 193 transitions, 1907 flow [2025-01-10 00:38:14,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1907, PETRI_PLACES=145, PETRI_TRANSITIONS=193} [2025-01-10 00:38:14,445 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 96 predicate places. [2025-01-10 00:38:14,445 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 193 transitions, 1907 flow [2025-01-10 00:38:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-01-10 00:38:14,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:14,445 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, 1, 1, 1] [2025-01-10 00:38:14,454 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-01-10 00:38:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:14,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 00:38:14,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash -444770913, now seen corresponding path program 2 times [2025-01-10 00:38:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:14,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697828111] [2025-01-10 00:38:14,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:14,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:14,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 00:38:14,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-01-10 00:38:14,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:14,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 00:38:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697828111] [2025-01-10 00:38:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697828111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:38:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356566743] [2025-01-10 00:38:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:14,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:14,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:38:14,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 193 transitions, 1907 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-01-10 00:38:14,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:14,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:38:14,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand