./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack-1.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-1.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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:37:29,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:37:29,135 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:29,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:37:29,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:37:29,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:37:29,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:37:29,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:37:29,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:37:29,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:37:29,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:37:29,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:37:29,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:37:29,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:37:29,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:37:29,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:29,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:29,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:29,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:37:29,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:29,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:29,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:29,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:29,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:37:29,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:37:29,172 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-01-10 00:37:29,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:37:29,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:37:29,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:37:29,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:37:29,470 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:37:29,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-01-10 00:37:30,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/675ea6b2f/471896a35fc04a60921eedf82d9ea24e/FLAG7b03db9dd [2025-01-10 00:37:31,242 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:37:31,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-01-10 00:37:31,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/675ea6b2f/471896a35fc04a60921eedf82d9ea24e/FLAG7b03db9dd [2025-01-10 00:37:31,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/675ea6b2f/471896a35fc04a60921eedf82d9ea24e [2025-01-10 00:37:31,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:37:31,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:37:31,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:31,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:37:31,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:37:31,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:31" (1/1) ... [2025-01-10 00:37:31,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4c5de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:31, skipping insertion in model container [2025-01-10 00:37:31,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:31" (1/1) ... [2025-01-10 00:37:31,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:37:31,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:31,728 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:37:31,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:31,831 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:37:31,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:31 WrapperNode [2025-01-10 00:37:31,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:31,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:31,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:37:31,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:37:31,838 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:31" (1/1) ... [2025-01-10 00:37:31,852 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:31" (1/1) ... [2025-01-10 00:37:31,872 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 148 [2025-01-10 00:37:31,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:31,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:37:31,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:37:31,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:37:31,883 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:31" (1/1) ... [2025-01-10 00:37:31,883 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:31" (1/1) ... [2025-01-10 00:37:31,888 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:31" (1/1) ... [2025-01-10 00:37:31,907 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 00:37:31,909 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:31" (1/1) ... [2025-01-10 00:37:31,909 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:31" (1/1) ... [2025-01-10 00:37:31,922 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:31" (1/1) ... [2025-01-10 00:37:31,925 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:31" (1/1) ... [2025-01-10 00:37:31,930 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:31" (1/1) ... [2025-01-10 00:37:31,931 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:31" (1/1) ... [2025-01-10 00:37:31,937 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:31" (1/1) ... [2025-01-10 00:37:31,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:37:31,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:37:31,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:37:31,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:37:31,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:31" (1/1) ... [2025-01-10 00:37:31,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:31,986 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:31,990 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:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:37:32,014 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:37:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:37:32,014 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:37:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:37:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:37:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:37:32,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:37:32,016 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:32,179 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:37:32,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:37:32,475 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:37:32,475 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:37:32,671 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:37:32,671 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:37:32,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:32 BoogieIcfgContainer [2025-01-10 00:37:32,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:37:32,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:37:32,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:37:32,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:37:32,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:37:31" (1/3) ... [2025-01-10 00:37:32,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208e8049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:32, skipping insertion in model container [2025-01-10 00:37:32,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:31" (2/3) ... [2025-01-10 00:37:32,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208e8049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:32, skipping insertion in model container [2025-01-10 00:37:32,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:32" (3/3) ... [2025-01-10 00:37:32,680 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-01-10 00:37:32,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:37:32,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 46 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-10 00:37:32,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:37:32,764 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:37:32,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 122 flow [2025-01-10 00:37:32,833 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-01-10 00:37:32,837 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:37:32,841 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 132 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:32,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 54 transitions, 122 flow [2025-01-10 00:37:32,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 51 transitions, 114 flow [2025-01-10 00:37:32,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:32,873 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;@6320606e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:32,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 00:37:32,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:32,906 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-01-10 00:37:32,906 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:37:32,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:32,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:32,907 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:32,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2102501209, now seen corresponding path program 1 times [2025-01-10 00:37:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732560759] [2025-01-10 00:37:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:32,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:33,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:33,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:33,247 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:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732560759] [2025-01-10 00:37:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732560759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:33,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742234200] [2025-01-10 00:37:33,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:33,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:33,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:33,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:33,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:33,313 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:33,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:33,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:33,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:33,615 INFO L124 PetriNetUnfolderBase]: 459/866 cut-off events. [2025-01-10 00:37:33,618 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-10 00:37:33,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 866 events. 459/866 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4345 event pairs, 245 based on Foata normal form. 94/832 useless extension candidates. Maximal degree in co-relation 1560. Up to 520 conditions per place. [2025-01-10 00:37:33,630 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 43 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 00:37:33,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 225 flow [2025-01-10 00:37:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 00:37:33,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-01-10 00:37:33,648 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:33,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 225 flow [2025-01-10 00:37:33,654 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:33,657 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 98 flow [2025-01-10 00:37:33,661 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:33,664 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-01-10 00:37:33,664 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 98 flow [2025-01-10 00:37:33,664 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:33,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:33,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:33,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:37:33,665 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:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2102501210, now seen corresponding path program 1 times [2025-01-10 00:37:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706833573] [2025-01-10 00:37:33,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:33,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:33,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:33,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:33,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:33,973 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:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706833573] [2025-01-10 00:37:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706833573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286956700] [2025-01-10 00:37:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:33,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:33,997 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:33,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:33,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:33,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:34,319 INFO L124 PetriNetUnfolderBase]: 574/1064 cut-off events. [2025-01-10 00:37:34,319 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 00:37:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1064 events. 574/1064 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5060 event pairs, 179 based on Foata normal form. 9/926 useless extension candidates. Maximal degree in co-relation 695. Up to 755 conditions per place. [2025-01-10 00:37:34,330 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 59 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-01-10 00:37:34,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 293 flow [2025-01-10 00:37:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-01-10 00:37:34,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2025-01-10 00:37:34,332 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:34,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 293 flow [2025-01-10 00:37:34,333 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:34,334 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 128 flow [2025-01-10 00:37:34,337 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:34,339 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-01-10 00:37:34,340 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 128 flow [2025-01-10 00:37:34,340 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:34,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:34,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:34,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:37:34,341 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:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 858839680, now seen corresponding path program 1 times [2025-01-10 00:37:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898071139] [2025-01-10 00:37:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:34,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:37:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:37:34,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:34,434 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:34,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898071139] [2025-01-10 00:37:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898071139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:34,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718028290] [2025-01-10 00:37:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:34,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:34,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:34,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:34,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:34,436 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:34,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:34,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:34,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:34,711 INFO L124 PetriNetUnfolderBase]: 823/1511 cut-off events. [2025-01-10 00:37:34,713 INFO L125 PetriNetUnfolderBase]: For 263/266 co-relation queries the response was YES. [2025-01-10 00:37:34,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1511 events. 823/1511 cut-off events. For 263/266 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7760 event pairs, 363 based on Foata normal form. 1/1366 useless extension candidates. Maximal degree in co-relation 1126. Up to 857 conditions per place. [2025-01-10 00:37:34,724 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 68 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-01-10 00:37:34,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 370 flow [2025-01-10 00:37:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-01-10 00:37:34,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 00:37:34,728 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:34,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 370 flow [2025-01-10 00:37:34,729 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:34,732 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 159 flow [2025-01-10 00:37:34,732 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:34,733 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-01-10 00:37:34,733 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 159 flow [2025-01-10 00:37:34,734 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:34,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:34,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:34,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:37:34,734 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:34,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1564770918, now seen corresponding path program 1 times [2025-01-10 00:37:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480641262] [2025-01-10 00:37:34,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:37:34,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:37:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:34,781 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:34,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480641262] [2025-01-10 00:37:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480641262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049135160] [2025-01-10 00:37:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:34,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:34,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:34,787 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:34,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:34,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:34,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:35,000 INFO L124 PetriNetUnfolderBase]: 957/1715 cut-off events. [2025-01-10 00:37:35,000 INFO L125 PetriNetUnfolderBase]: For 546/548 co-relation queries the response was YES. [2025-01-10 00:37:35,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 1715 events. 957/1715 cut-off events. For 546/548 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8861 event pairs, 395 based on Foata normal form. 12/1574 useless extension candidates. Maximal degree in co-relation 1267. Up to 1191 conditions per place. [2025-01-10 00:37:35,015 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-10 00:37:35,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 328 flow [2025-01-10 00:37:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 00:37:35,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-01-10 00:37:35,017 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:35,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 328 flow [2025-01-10 00:37:35,021 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:35,022 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 168 flow [2025-01-10 00:37:35,022 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:35,023 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-01-10 00:37:35,023 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 168 flow [2025-01-10 00:37:35,023 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:35,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:35,023 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:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:37:35,024 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:35,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1300377519, now seen corresponding path program 1 times [2025-01-10 00:37:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006977861] [2025-01-10 00:37:35,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:35,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:35,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:35,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,112 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:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006977861] [2025-01-10 00:37:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006977861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396585099] [2025-01-10 00:37:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:35,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:35,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:35,115 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:35,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:35,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:35,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:35,251 INFO L124 PetriNetUnfolderBase]: 499/1033 cut-off events. [2025-01-10 00:37:35,252 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-01-10 00:37:35,254 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 4799 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:35,258 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 45 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-01-10 00:37:35,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 300 flow [2025-01-10 00:37:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-01-10 00:37:35,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-01-10 00:37:35,259 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:35,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 300 flow [2025-01-10 00:37:35,263 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:35,264 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 170 flow [2025-01-10 00:37:35,265 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:35,266 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-01-10 00:37:35,266 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 170 flow [2025-01-10 00:37:35,266 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:35,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:35,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:35,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:37:35,267 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:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1742799038, now seen corresponding path program 1 times [2025-01-10 00:37:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587487384] [2025-01-10 00:37:35,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:35,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:35,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,660 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:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587487384] [2025-01-10 00:37:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587487384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144979907] [2025-01-10 00:37:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:35,665 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:35,666 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:35,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:35,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:35,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 00:37:35,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:36,070 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:36,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:36,253 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:36,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144979907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:36,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:36,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-10 00:37:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030591691] [2025-01-10 00:37:36,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:36,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:37:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:36,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:37:36,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:37:36,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-01-10 00:37:36,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 170 flow. Second operand has 15 states, 15 states have (on average 17.0) internal successors, (255), 15 states have internal predecessors, (255), 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:36,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:36,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-01-10 00:37:36,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:37,435 INFO L124 PetriNetUnfolderBase]: 1740/3509 cut-off events. [2025-01-10 00:37:37,435 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-01-10 00:37:37,443 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 86. Compared 19728 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:37,460 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 194 selfloop transitions, 26 changer transitions 0/231 dead transitions. [2025-01-10 00:37:37,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 231 transitions, 1170 flow [2025-01-10 00:37:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:37:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 00:37:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2025-01-10 00:37:37,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2025-01-10 00:37:37,464 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:37,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 231 transitions, 1170 flow [2025-01-10 00:37:37,471 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:37,475 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 417 flow [2025-01-10 00:37:37,476 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:37,478 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2025-01-10 00:37:37,478 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 417 flow [2025-01-10 00:37:37,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.0) internal successors, (255), 15 states have internal predecessors, (255), 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:37,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:37,480 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:37,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:37:37,680 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:37,681 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:37,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -67956447, now seen corresponding path program 1 times [2025-01-10 00:37:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373959943] [2025-01-10 00:37:37,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:37:37,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:37:37,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:37,786 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:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373959943] [2025-01-10 00:37:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373959943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092510493] [2025-01-10 00:37:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:37,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:37,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:37,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:37,800 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:37,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:37,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:37,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:38,208 INFO L124 PetriNetUnfolderBase]: 1695/3429 cut-off events. [2025-01-10 00:37:38,208 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-01-10 00:37:38,219 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 19746 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:37:38,234 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 64 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 00:37:38,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 566 flow [2025-01-10 00:37:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 00:37:38,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 00:37:38,236 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:37:38,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 566 flow [2025-01-10 00:37:38,246 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:37:38,248 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 411 flow [2025-01-10 00:37:38,248 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:37:38,249 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2025-01-10 00:37:38,249 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 411 flow [2025-01-10 00:37:38,249 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:37:38,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:38,249 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:38,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:37:38,249 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:37:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1388995690, now seen corresponding path program 1 times [2025-01-10 00:37:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808280320] [2025-01-10 00:37:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:38,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:37:38,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:37:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:38,498 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:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808280320] [2025-01-10 00:37:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808280320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171258017] [2025-01-10 00:37:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:37:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:38,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:37:38,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:37:38,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:37:38,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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:38,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:38,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:37:38,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:39,087 INFO L124 PetriNetUnfolderBase]: 1780/3573 cut-off events. [2025-01-10 00:37:39,088 INFO L125 PetriNetUnfolderBase]: For 2161/2161 co-relation queries the response was YES. [2025-01-10 00:37:39,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9289 conditions, 3573 events. 1780/3573 cut-off events. For 2161/2161 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 20354 event pairs, 436 based on Foata normal form. 0/3428 useless extension candidates. Maximal degree in co-relation 7786. Up to 2729 conditions per place. [2025-01-10 00:37:39,120 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 100 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2025-01-10 00:37:39,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 776 flow [2025-01-10 00:37:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:37:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:37:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-01-10 00:37:39,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2025-01-10 00:37:39,123 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 411 flow. Second operand 7 states and 185 transitions. [2025-01-10 00:37:39,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 776 flow [2025-01-10 00:37:39,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 768 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:39,139 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 458 flow [2025-01-10 00:37:39,139 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=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-01-10 00:37:39,143 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-01-10 00:37:39,143 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 458 flow [2025-01-10 00:37:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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:39,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:39,144 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:37:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:37:39,144 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:37:39,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1164831394, now seen corresponding path program 1 times [2025-01-10 00:37:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793592660] [2025-01-10 00:37:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:39,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:37:39,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:37:39,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:39,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:39,184 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:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793592660] [2025-01-10 00:37:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793592660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057715401] [2025-01-10 00:37:39,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:39,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:39,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:39,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:39,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:39,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 458 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:37:39,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:39,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:39,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:39,809 INFO L124 PetriNetUnfolderBase]: 2658/5549 cut-off events. [2025-01-10 00:37:39,809 INFO L125 PetriNetUnfolderBase]: For 3888/3888 co-relation queries the response was YES. [2025-01-10 00:37:39,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14231 conditions, 5549 events. 2658/5549 cut-off events. For 3888/3888 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 36715 event pairs, 1282 based on Foata normal form. 137/5489 useless extension candidates. Maximal degree in co-relation 12407. Up to 3123 conditions per place. [2025-01-10 00:37:39,847 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 121 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-01-10 00:37:39,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 135 transitions, 1088 flow [2025-01-10 00:37:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 00:37:39,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-01-10 00:37:39,848 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 458 flow. Second operand 3 states and 104 transitions. [2025-01-10 00:37:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 135 transitions, 1088 flow [2025-01-10 00:37:39,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1072 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:39,865 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 461 flow [2025-01-10 00:37:39,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-01-10 00:37:39,866 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-01-10 00:37:39,866 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 461 flow [2025-01-10 00:37:39,867 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:37:39,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:39,867 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:37:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:37:39,867 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:37:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1777262199, now seen corresponding path program 1 times [2025-01-10 00:37:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482396887] [2025-01-10 00:37:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:39,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:37:39,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:37:39,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:39,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:40,467 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:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482396887] [2025-01-10 00:37:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482396887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:40,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:40,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:37:40,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377949957] [2025-01-10 00:37:40,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:40,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:37:40,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:40,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:37:40,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:37:40,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:40,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 461 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:37:40,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:40,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:40,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:41,715 INFO L124 PetriNetUnfolderBase]: 3462/7028 cut-off events. [2025-01-10 00:37:41,715 INFO L125 PetriNetUnfolderBase]: For 5748/5748 co-relation queries the response was YES. [2025-01-10 00:37:41,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19704 conditions, 7028 events. 3462/7028 cut-off events. For 5748/5748 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 44904 event pairs, 786 based on Foata normal form. 0/6808 useless extension candidates. Maximal degree in co-relation 16129. Up to 3938 conditions per place. [2025-01-10 00:37:41,771 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 165 selfloop transitions, 12 changer transitions 0/189 dead transitions. [2025-01-10 00:37:41,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 189 transitions, 1335 flow [2025-01-10 00:37:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:37:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:37:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 319 transitions. [2025-01-10 00:37:41,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49228395061728397 [2025-01-10 00:37:41,773 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 461 flow. Second operand 12 states and 319 transitions. [2025-01-10 00:37:41,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 189 transitions, 1335 flow [2025-01-10 00:37:41,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 1323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:41,797 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 523 flow [2025-01-10 00:37:41,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=523, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2025-01-10 00:37:41,799 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2025-01-10 00:37:41,799 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 523 flow [2025-01-10 00:37:41,800 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:37:41,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:41,800 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:37:41,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:37:41,801 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:37:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -633869384, now seen corresponding path program 1 times [2025-01-10 00:37:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442935521] [2025-01-10 00:37:41,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:37:41,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:37:41,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:41,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442935521] [2025-01-10 00:37:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442935521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:41,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98662116] [2025-01-10 00:37:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:41,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:41,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:41,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 523 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:37:41,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:41,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:41,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:42,952 INFO L124 PetriNetUnfolderBase]: 4935/10396 cut-off events. [2025-01-10 00:37:42,953 INFO L125 PetriNetUnfolderBase]: For 10233/10233 co-relation queries the response was YES. [2025-01-10 00:37:43,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29147 conditions, 10396 events. 4935/10396 cut-off events. For 10233/10233 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 76302 event pairs, 1723 based on Foata normal form. 307/10384 useless extension candidates. Maximal degree in co-relation 24226. Up to 4409 conditions per place. [2025-01-10 00:37:43,039 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 189 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2025-01-10 00:37:43,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 204 transitions, 1774 flow [2025-01-10 00:37:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-01-10 00:37:43,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:37:43,041 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 523 flow. Second operand 4 states and 144 transitions. [2025-01-10 00:37:43,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 204 transitions, 1774 flow [2025-01-10 00:37:43,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 204 transitions, 1721 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 00:37:43,074 INFO L231 Difference]: Finished difference. Result has 100 places, 84 transitions, 519 flow [2025-01-10 00:37:43,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=96, 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=100, PETRI_TRANSITIONS=84} [2025-01-10 00:37:43,075 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2025-01-10 00:37:43,075 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 84 transitions, 519 flow [2025-01-10 00:37:43,075 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:37:43,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:43,075 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:37:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:37:43,076 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:37:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2044067080, now seen corresponding path program 1 times [2025-01-10 00:37:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349568716] [2025-01-10 00:37:43,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:43,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:37:43,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:37:43,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:43,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:43,563 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:37:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349568716] [2025-01-10 00:37:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349568716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192934871] [2025-01-10 00:37:43,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:43,566 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:37:43,569 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:37:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:37:43,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:37:43,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:43,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:43,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:37:43,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:44,014 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:37:44,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:44,272 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:37:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192934871] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:44,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:44,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-01-10 00:37:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286939840] [2025-01-10 00:37:44,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:44,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:37:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:44,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:37:44,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:37:44,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-01-10 00:37:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 84 transitions, 519 flow. Second operand has 18 states, 18 states have (on average 18.166666666666668) internal successors, (327), 18 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:44,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:44,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-01-10 00:37:44,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:47,502 INFO L124 PetriNetUnfolderBase]: 10387/20853 cut-off events. [2025-01-10 00:37:47,503 INFO L125 PetriNetUnfolderBase]: For 25687/25695 co-relation queries the response was YES. [2025-01-10 00:37:47,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62306 conditions, 20853 events. 10387/20853 cut-off events. For 25687/25695 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 159950 event pairs, 1474 based on Foata normal form. 225/20385 useless extension candidates. Maximal degree in co-relation 48227. Up to 3457 conditions per place. [2025-01-10 00:37:47,800 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 338 selfloop transitions, 60 changer transitions 0/408 dead transitions. [2025-01-10 00:37:47,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 408 transitions, 2917 flow [2025-01-10 00:37:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 00:37:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 00:37:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 610 transitions. [2025-01-10 00:37:47,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5379188712522046 [2025-01-10 00:37:47,805 INFO L175 Difference]: Start difference. First operand has 100 places, 84 transitions, 519 flow. Second operand 21 states and 610 transitions. [2025-01-10 00:37:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 408 transitions, 2917 flow [2025-01-10 00:37:47,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 408 transitions, 2856 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:47,885 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 1047 flow [2025-01-10 00:37:47,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1047, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-01-10 00:37:47,887 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 82 predicate places. [2025-01-10 00:37:47,887 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 1047 flow [2025-01-10 00:37:47,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.166666666666668) internal successors, (327), 18 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:47,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:47,887 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:37:47,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:37:48,088 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:37:48,088 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:37:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -126856627, now seen corresponding path program 1 times [2025-01-10 00:37:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878147008] [2025-01-10 00:37:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:37:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:37:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878147008] [2025-01-10 00:37:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878147008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331054401] [2025-01-10 00:37:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:48,806 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:37:48,809 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:37:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:37:48,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:37:48,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:48,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:48,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 00:37:48,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:49,154 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:37:49,332 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:37:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:37:49,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:37:49,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331054401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:49,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:37:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2025-01-10 00:37:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035418429] [2025-01-10 00:37:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:49,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:37:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:49,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:37:49,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:37:49,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:49,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 1047 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:37:49,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:49,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:49,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:53,602 INFO L124 PetriNetUnfolderBase]: 14547/29199 cut-off events. [2025-01-10 00:37:53,602 INFO L125 PetriNetUnfolderBase]: For 54172/54172 co-relation queries the response was YES. [2025-01-10 00:37:53,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94415 conditions, 29199 events. 14547/29199 cut-off events. For 54172/54172 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 241249 event pairs, 2010 based on Foata normal form. 0/28346 useless extension candidates. Maximal degree in co-relation 87879. Up to 5948 conditions per place. [2025-01-10 00:37:53,797 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 164 selfloop transitions, 142 changer transitions 0/318 dead transitions. [2025-01-10 00:37:53,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 318 transitions, 2843 flow [2025-01-10 00:37:53,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:37:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 00:37:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 420 transitions. [2025-01-10 00:37:53,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-01-10 00:37:53,799 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 1047 flow. Second operand 17 states and 420 transitions. [2025-01-10 00:37:53,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 318 transitions, 2843 flow [2025-01-10 00:37:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 318 transitions, 2686 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:54,013 INFO L231 Difference]: Finished difference. Result has 148 places, 195 transitions, 1952 flow [2025-01-10 00:37:54,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1952, PETRI_PLACES=148, PETRI_TRANSITIONS=195} [2025-01-10 00:37:54,014 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 99 predicate places. [2025-01-10 00:37:54,014 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 195 transitions, 1952 flow [2025-01-10 00:37:54,015 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:37:54,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:54,015 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:37:54,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:37:54,219 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:37:54,219 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:37:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1007639758, now seen corresponding path program 2 times [2025-01-10 00:37:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512274520] [2025-01-10 00:37:54,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:37:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:54,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 00:37:54,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-01-10 00:37:54,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:37:54,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:37:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512274520] [2025-01-10 00:37:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512274520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:54,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590516581] [2025-01-10 00:37:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:54,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:54,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:54,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-01-10 00:37:54,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 195 transitions, 1952 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:37:54,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:54,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-01-10 00:37:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:57,975 INFO L124 PetriNetUnfolderBase]: 14516/29029 cut-off events. [2025-01-10 00:37:57,976 INFO L125 PetriNetUnfolderBase]: For 59686/59686 co-relation queries the response was YES. [2025-01-10 00:37:58,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98359 conditions, 29029 events. 14516/29029 cut-off events. For 59686/59686 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 240234 event pairs, 11236 based on Foata normal form. 70/28249 useless extension candidates. Maximal degree in co-relation 91420. Up to 23903 conditions per place. [2025-01-10 00:37:58,209 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 231 selfloop transitions, 3 changer transitions 0/246 dead transitions. [2025-01-10 00:37:58,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 246 transitions, 2807 flow [2025-01-10 00:37:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-01-10 00:37:58,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2025-01-10 00:37:58,210 INFO L175 Difference]: Start difference. First operand has 148 places, 195 transitions, 1952 flow. Second operand 4 states and 139 transitions. [2025-01-10 00:37:58,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 246 transitions, 2807 flow [2025-01-10 00:37:58,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 246 transitions, 2614 flow, removed 96 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:58,566 INFO L231 Difference]: Finished difference. Result has 151 places, 196 transitions, 1811 flow [2025-01-10 00:37:58,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1811, PETRI_PLACES=151, PETRI_TRANSITIONS=196} [2025-01-10 00:37:58,566 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 102 predicate places. [2025-01-10 00:37:58,567 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 196 transitions, 1811 flow [2025-01-10 00:37:58,567 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:37:58,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:58,567 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:37:58,567 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:58,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1496213736, now seen corresponding path program 1 times [2025-01-10 00:37:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700330816] [2025-01-10 00:37:58,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:58,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:37:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:37:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:59,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:59,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700330816] [2025-01-10 00:37:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700330816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:37:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681407215] [2025-01-10 00:37:59,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:37:59,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:59,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:37:59,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:37:59,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:37:59,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:37:59,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:59,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:59,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:37:59,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:37:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:59,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681407215] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:59,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-01-10 00:37:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280802761] [2025-01-10 00:37:59,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:59,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:37:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:59,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:37:59,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:38:00,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-01-10 00:38:00,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 196 transitions, 1811 flow. Second operand has 19 states, 19 states have (on average 19.05263157894737) internal successors, (362), 19 states have internal predecessors, (362), 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,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:00,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-01-10 00:38:00,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:04,407 INFO L124 PetriNetUnfolderBase]: 15081/29688 cut-off events. [2025-01-10 00:38:04,408 INFO L125 PetriNetUnfolderBase]: For 53187/53193 co-relation queries the response was YES. [2025-01-10 00:38:04,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100165 conditions, 29688 events. 15081/29688 cut-off events. For 53187/53193 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 238889 event pairs, 2852 based on Foata normal form. 196/29173 useless extension candidates. Maximal degree in co-relation 93529. Up to 5039 conditions per place. [2025-01-10 00:38:04,643 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 431 selfloop transitions, 149 changer transitions 0/590 dead transitions. [2025-01-10 00:38:04,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 590 transitions, 5200 flow [2025-01-10 00:38:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 00:38:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 00:38:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 694 transitions. [2025-01-10 00:38:04,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5140740740740741 [2025-01-10 00:38:04,646 INFO L175 Difference]: Start difference. First operand has 151 places, 196 transitions, 1811 flow. Second operand 25 states and 694 transitions. [2025-01-10 00:38:04,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 590 transitions, 5200 flow [2025-01-10 00:38:04,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 590 transitions, 5151 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:04,917 INFO L231 Difference]: Finished difference. Result has 185 places, 273 transitions, 2964 flow [2025-01-10 00:38:04,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2964, PETRI_PLACES=185, PETRI_TRANSITIONS=273} [2025-01-10 00:38:04,917 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 136 predicate places. [2025-01-10 00:38:04,917 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 273 transitions, 2964 flow [2025-01-10 00:38:04,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.05263157894737) internal successors, (362), 19 states have internal predecessors, (362), 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,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:04,918 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:04,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:38:05,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:38:05,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:38:05,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1436332856, now seen corresponding path program 1 times [2025-01-10 00:38:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88356675] [2025-01-10 00:38:05,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:05,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:38:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:38:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:05,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88356675] [2025-01-10 00:38:05,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88356675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:05,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192681668] [2025-01-10 00:38:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:05,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:05,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:38:05,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:38:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:38:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:05,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:38:05,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192681668] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:05,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-10 00:38:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335108409] [2025-01-10 00:38:05,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:38:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:05,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:38:05,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:38:05,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:38:05,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 273 transitions, 2964 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:05,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:38:05,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:12,375 INFO L124 PetriNetUnfolderBase]: 22616/45119 cut-off events. [2025-01-10 00:38:12,375 INFO L125 PetriNetUnfolderBase]: For 129332/129344 co-relation queries the response was YES. [2025-01-10 00:38:12,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163011 conditions, 45119 events. 22616/45119 cut-off events. For 129332/129344 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 393383 event pairs, 6478 based on Foata normal form. 1308/45884 useless extension candidates. Maximal degree in co-relation 149950. Up to 8308 conditions per place. [2025-01-10 00:38:12,922 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 531 selfloop transitions, 146 changer transitions 0/688 dead transitions. [2025-01-10 00:38:12,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 688 transitions, 8153 flow [2025-01-10 00:38:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:38:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:38:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-01-10 00:38:12,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-01-10 00:38:12,924 INFO L175 Difference]: Start difference. First operand has 185 places, 273 transitions, 2964 flow. Second operand 8 states and 300 transitions. [2025-01-10 00:38:12,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 688 transitions, 8153 flow [2025-01-10 00:38:14,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 688 transitions, 7654 flow, removed 201 selfloop flow, removed 9 redundant places. [2025-01-10 00:38:14,071 INFO L231 Difference]: Finished difference. Result has 189 places, 352 transitions, 4361 flow [2025-01-10 00:38:14,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4361, PETRI_PLACES=189, PETRI_TRANSITIONS=352} [2025-01-10 00:38:14,072 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 140 predicate places. [2025-01-10 00:38:14,072 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 352 transitions, 4361 flow [2025-01-10 00:38:14,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:14,073 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:14,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:38:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:38:14,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:14,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1701572244, now seen corresponding path program 1 times [2025-01-10 00:38:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:14,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674131074] [2025-01-10 00:38:14,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 00:38:14,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 00:38:14,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:14,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 00:38:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674131074] [2025-01-10 00:38:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674131074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428520751] [2025-01-10 00:38:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:14,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:38:14,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 352 transitions, 4361 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:14,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:38:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:20,184 INFO L124 PetriNetUnfolderBase]: 20198/40044 cut-off events. [2025-01-10 00:38:20,184 INFO L125 PetriNetUnfolderBase]: For 135166/135223 co-relation queries the response was YES. [2025-01-10 00:38:20,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152055 conditions, 40044 events. 20198/40044 cut-off events. For 135166/135223 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 339690 event pairs, 13325 based on Foata normal form. 728/40495 useless extension candidates. Maximal degree in co-relation 139411. Up to 28639 conditions per place. [2025-01-10 00:38:20,821 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 302 selfloop transitions, 72 changer transitions 0/385 dead transitions. [2025-01-10 00:38:20,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 385 transitions, 5297 flow [2025-01-10 00:38:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-01-10 00:38:20,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-01-10 00:38:20,822 INFO L175 Difference]: Start difference. First operand has 189 places, 352 transitions, 4361 flow. Second operand 3 states and 98 transitions. [2025-01-10 00:38:20,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 385 transitions, 5297 flow [2025-01-10 00:38:21,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 385 transitions, 5217 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:21,671 INFO L231 Difference]: Finished difference. Result has 189 places, 334 transitions, 4338 flow [2025-01-10 00:38:21,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3867, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4338, PETRI_PLACES=189, PETRI_TRANSITIONS=334} [2025-01-10 00:38:21,672 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 140 predicate places. [2025-01-10 00:38:21,672 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 334 transitions, 4338 flow [2025-01-10 00:38:21,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:21,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:21,672 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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:21,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:38:21,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash 6700712, now seen corresponding path program 3 times [2025-01-10 00:38:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520935605] [2025-01-10 00:38:21,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:38:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:21,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-01-10 00:38:21,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 43 statements. [2025-01-10 00:38:21,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:38:21,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 00:38:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520935605] [2025-01-10 00:38:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520935605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394805028] [2025-01-10 00:38:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:21,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:21,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:21,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:38:21,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 334 transitions, 4338 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:21,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:21,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:38:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:27,774 INFO L124 PetriNetUnfolderBase]: 19468/38931 cut-off events. [2025-01-10 00:38:27,774 INFO L125 PetriNetUnfolderBase]: For 136354/136390 co-relation queries the response was YES. [2025-01-10 00:38:28,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149377 conditions, 38931 events. 19468/38931 cut-off events. For 136354/136390 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 333531 event pairs, 15728 based on Foata normal form. 139/38725 useless extension candidates. Maximal degree in co-relation 133384. Up to 34286 conditions per place. [2025-01-10 00:38:28,142 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 314 selfloop transitions, 1 changer transitions 2/333 dead transitions. [2025-01-10 00:38:28,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 333 transitions, 4968 flow [2025-01-10 00:38:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-01-10 00:38:28,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-01-10 00:38:28,143 INFO L175 Difference]: Start difference. First operand has 189 places, 334 transitions, 4338 flow. Second operand 3 states and 76 transitions. [2025-01-10 00:38:28,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 333 transitions, 4968 flow [2025-01-10 00:38:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 333 transitions, 4784 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:28,875 INFO L231 Difference]: Finished difference. Result has 188 places, 331 transitions, 4149 flow [2025-01-10 00:38:28,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4152, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4149, PETRI_PLACES=188, PETRI_TRANSITIONS=331} [2025-01-10 00:38:28,876 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 139 predicate places. [2025-01-10 00:38:28,876 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 331 transitions, 4149 flow [2025-01-10 00:38:28,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:28,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:28,876 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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:28,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:38:28,876 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1484748116, now seen corresponding path program 1 times [2025-01-10 00:38:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689904401] [2025-01-10 00:38:28,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 00:38:28,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 00:38:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689904401] [2025-01-10 00:38:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689904401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531014430] [2025-01-10 00:38:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:29,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:29,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:38:29,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 00:38:29,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 00:38:29,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:29,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:29,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-10 00:38:29,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:30,008 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:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:38:30,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-01-10 00:38:30,341 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:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:30,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:30,839 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 54 treesize of output 46 [2025-01-10 00:38:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:38:30,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531014430] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:30,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:30,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-01-10 00:38:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248195305] [2025-01-10 00:38:30,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:30,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 00:38:30,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:30,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 00:38:30,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 00:38:31,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-01-10 00:38:31,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 331 transitions, 4149 flow. Second operand has 35 states, 35 states have (on average 18.0) internal successors, (630), 35 states have internal predecessors, (630), 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:31,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:31,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-01-10 00:38:31,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand