./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp1x3.wvr.c --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/weaver/bench-exp1x3.wvr.c -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 52eeb5cce5645e9dacc261319eae3d665b5cc432ff3ddd2ef39502a44996e68d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:22,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:22,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:22,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:22,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:22,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:22,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:22,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:22,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:22,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:22,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:22,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:22,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:22,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:22,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:22,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:22,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:22,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:22,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:22,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:22,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:22,192 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 -> 52eeb5cce5645e9dacc261319eae3d665b5cc432ff3ddd2ef39502a44996e68d [2025-01-10 01:00:22,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:22,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:22,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:22,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:22,399 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:22,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp1x3.wvr.c [2025-01-10 01:00:23,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdc78663d/e478945d43334d758f5386c1ee585953/FLAG57c88db51 [2025-01-10 01:00:23,787 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:23,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp1x3.wvr.c [2025-01-10 01:00:23,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdc78663d/e478945d43334d758f5386c1ee585953/FLAG57c88db51 [2025-01-10 01:00:23,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bdc78663d/e478945d43334d758f5386c1ee585953 [2025-01-10 01:00:23,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:23,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:23,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:23,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:23,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:23,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:23" (1/1) ... [2025-01-10 01:00:23,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbdc19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:23, skipping insertion in model container [2025-01-10 01:00:23,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:23" (1/1) ... [2025-01-10 01:00:23,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:24,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:24,126 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:24,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:24,173 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:24,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24 WrapperNode [2025-01-10 01:00:24,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:24,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:24,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:24,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:24,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,207 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 49 [2025-01-10 01:00:24,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:24,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:24,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:24,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:24,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:00:24,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:24,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:24,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:24,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:24,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (1/1) ... [2025-01-10 01:00:24,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:24,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:24,330 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 01:00:24,340 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 01:00:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:24,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:00:24,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:00:24,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:00:24,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:00:24,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:24,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:24,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:24,381 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 01:00:24,514 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:24,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:24,663 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:24,663 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:24,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:24,786 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:24,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:24 BoogieIcfgContainer [2025-01-10 01:00:24,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:24,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:24,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:24,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:24,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:23" (1/3) ... [2025-01-10 01:00:24,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb5a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:24, skipping insertion in model container [2025-01-10 01:00:24,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:24" (2/3) ... [2025-01-10 01:00:24,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb5a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:24, skipping insertion in model container [2025-01-10 01:00:24,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:24" (3/3) ... [2025-01-10 01:00:24,798 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2025-01-10 01:00:24,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:24,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp1x3.wvr.c that has 3 procedures, 19 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:00:24,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:24,847 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:00:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 54 flow [2025-01-10 01:00:24,889 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-01-10 01:00:24,891 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:00:24,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 2/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-01-10 01:00:24,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 20 transitions, 54 flow [2025-01-10 01:00:24,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 17 transitions, 46 flow [2025-01-10 01:00:24,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:24,910 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;@15df83ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:24,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:00:24,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:24,917 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-01-10 01:00:24,917 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:00:24,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:24,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:24,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1962499965, now seen corresponding path program 1 times [2025-01-10 01:00:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175982405] [2025-01-10 01:00:24,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:24,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:00:24,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:00:24,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:24,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,124 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 01:00:25,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175982405] [2025-01-10 01:00:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175982405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066693731] [2025-01-10 01:00:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:25,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:25,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:25,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 01:00:25,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,205 INFO L124 PetriNetUnfolderBase]: 59/104 cut-off events. [2025-01-10 01:00:25,206 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:00:25,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 104 events. 59/104 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 277 event pairs, 8 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-01-10 01:00:25,207 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2025-01-10 01:00:25,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 111 flow [2025-01-10 01:00:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-10 01:00:25,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-10 01:00:25,217 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 46 flow. Second operand 3 states and 41 transitions. [2025-01-10 01:00:25,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 111 flow [2025-01-10 01:00:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 97 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:00:25,222 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2025-01-10 01:00:25,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-01-10 01:00:25,225 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -3 predicate places. [2025-01-10 01:00:25,226 INFO L471 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2025-01-10 01:00:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 01:00:25,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:25,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1647217430, now seen corresponding path program 1 times [2025-01-10 01:00:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391783454] [2025-01-10 01:00:25,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:25,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:25,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391783454] [2025-01-10 01:00:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391783454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:25,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115291281] [2025-01-10 01:00:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:25,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:25,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:25,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 01:00:25,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:25,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,392 INFO L124 PetriNetUnfolderBase]: 57/101 cut-off events. [2025-01-10 01:00:25,392 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 01:00:25,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 101 events. 57/101 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 252 event pairs, 1 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 72. Up to 38 conditions per place. [2025-01-10 01:00:25,393 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 22 selfloop transitions, 6 changer transitions 4/35 dead transitions. [2025-01-10 01:00:25,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 35 transitions, 163 flow [2025-01-10 01:00:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-01-10 01:00:25,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-01-10 01:00:25,395 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 5 states and 63 transitions. [2025-01-10 01:00:25,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 35 transitions, 163 flow [2025-01-10 01:00:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 35 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:25,396 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 74 flow [2025-01-10 01:00:25,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2025-01-10 01:00:25,397 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-01-10 01:00:25,397 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 74 flow [2025-01-10 01:00:25,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 01:00:25,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:25,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash -169859984, now seen corresponding path program 2 times [2025-01-10 01:00:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69477713] [2025-01-10 01:00:25,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:00:25,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:25,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69477713] [2025-01-10 01:00:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69477713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770342821] [2025-01-10 01:00:25,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:25,497 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 01:00:25,502 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 01:00:25,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:00:25,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:25,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:25,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:25,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:25,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770342821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:25,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175583567] [2025-01-10 01:00:25,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:25,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:25,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:25,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:25,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 01:00:25,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:25,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:25,771 INFO L124 PetriNetUnfolderBase]: 49/92 cut-off events. [2025-01-10 01:00:25,772 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:00:25,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 92 events. 49/92 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 243 event pairs, 5 based on Foata normal form. 5/94 useless extension candidates. Maximal degree in co-relation 64. Up to 51 conditions per place. [2025-01-10 01:00:25,773 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 22 selfloop transitions, 7 changer transitions 2/34 dead transitions. [2025-01-10 01:00:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 181 flow [2025-01-10 01:00:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-01-10 01:00:25,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-01-10 01:00:25,774 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 74 flow. Second operand 5 states and 62 transitions. [2025-01-10 01:00:25,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 181 flow [2025-01-10 01:00:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:25,775 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 109 flow [2025-01-10 01:00:25,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-01-10 01:00:25,776 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2025-01-10 01:00:25,776 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 109 flow [2025-01-10 01:00:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 01:00:25,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:25,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:25,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:25,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -709034074, now seen corresponding path program 1 times [2025-01-10 01:00:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404146603] [2025-01-10 01:00:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:25,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:25,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404146603] [2025-01-10 01:00:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404146603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756063508] [2025-01-10 01:00:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:26,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:26,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 01:00:26,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:26,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:26,103 INFO L124 PetriNetUnfolderBase]: 46/88 cut-off events. [2025-01-10 01:00:26,103 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-10 01:00:26,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 88 events. 46/88 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 220 event pairs, 1 based on Foata normal form. 3/90 useless extension candidates. Maximal degree in co-relation 170. Up to 46 conditions per place. [2025-01-10 01:00:26,104 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 20 selfloop transitions, 4 changer transitions 7/34 dead transitions. [2025-01-10 01:00:26,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 207 flow [2025-01-10 01:00:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-01-10 01:00:26,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 01:00:26,106 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 109 flow. Second operand 5 states and 59 transitions. [2025-01-10 01:00:26,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 207 flow [2025-01-10 01:00:26,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 202 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:26,107 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 100 flow [2025-01-10 01:00:26,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2025-01-10 01:00:26,108 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2025-01-10 01:00:26,108 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 100 flow [2025-01-10 01:00:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 01:00:26,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:26,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:26,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:00:26,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:26,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 81945698, now seen corresponding path program 2 times [2025-01-10 01:00:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-01-10 01:00:26,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:26,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:00:26,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:26,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:26,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638405408] [2025-01-10 01:00:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638405408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141369101] [2025-01-10 01:00:26,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:26,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:26,173 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 01:00:26,175 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 01:00:26,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 01:00:26,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:26,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:26,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:26,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141369101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:26,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418230253] [2025-01-10 01:00:26,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:26,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:26,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:26,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 01:00:26,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:26,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:26,405 INFO L124 PetriNetUnfolderBase]: 37/70 cut-off events. [2025-01-10 01:00:26,405 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 01:00:26,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 70 events. 37/70 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 2 based on Foata normal form. 4/73 useless extension candidates. Maximal degree in co-relation 127. Up to 55 conditions per place. [2025-01-10 01:00:26,405 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2025-01-10 01:00:26,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 187 flow [2025-01-10 01:00:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-01-10 01:00:26,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-10 01:00:26,407 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 100 flow. Second operand 5 states and 55 transitions. [2025-01-10 01:00:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 187 flow [2025-01-10 01:00:26,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 175 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:26,408 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 131 flow [2025-01-10 01:00:26,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2025-01-10 01:00:26,409 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2025-01-10 01:00:26,409 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 131 flow [2025-01-10 01:00:26,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 01:00:26,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:26,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:26,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:26,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:26,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1140909591, now seen corresponding path program 1 times [2025-01-10 01:00:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:26,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-01-10 01:00:26,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:26,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:26,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:26,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-01-10 01:00:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624547478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371021731] [2025-01-10 01:00:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:26,936 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 01:00:26,938 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 01:00:26,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:00:27,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:27,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:00:27,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:45,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371021731] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:46,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:00:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967200282] [2025-01-10 01:00:46,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:00:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:46,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:00:46,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=147, Unknown=2, NotChecked=0, Total=210 [2025-01-10 01:00:46,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:00:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 131 flow. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 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 01:00:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:00:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:52,382 INFO L124 PetriNetUnfolderBase]: 125/239 cut-off events. [2025-01-10 01:00:52,382 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-01-10 01:00:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 239 events. 125/239 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 827 event pairs, 6 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 548. Up to 85 conditions per place. [2025-01-10 01:00:52,384 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 49 selfloop transitions, 25 changer transitions 14/91 dead transitions. [2025-01-10 01:00:52,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 651 flow [2025-01-10 01:00:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:00:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:00:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 161 transitions. [2025-01-10 01:00:52,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6192307692307693 [2025-01-10 01:00:52,389 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 131 flow. Second operand 13 states and 161 transitions. [2025-01-10 01:00:52,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 651 flow [2025-01-10 01:00:52,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 636 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:52,392 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 383 flow [2025-01-10 01:00:52,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=383, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-01-10 01:00:52,392 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2025-01-10 01:00:52,393 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 383 flow [2025-01-10 01:00:52,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 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 01:00:52,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:52,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:52,402 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 01:00:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:52,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:00:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1013991643, now seen corresponding path program 2 times [2025-01-10 01:00:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174058690] [2025-01-10 01:00:52,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:52,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:00:52,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:52,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:52,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174058690] [2025-01-10 01:00:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174058690] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473225447] [2025-01-10 01:00:52,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:52,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:52,810 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 01:00:52,812 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 01:00:52,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:00:52,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:00:52,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:52,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:00:52,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:13,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:16,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473225447] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:16,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:16,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-01-10 01:01:16,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59763786] [2025-01-10 01:01:16,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:16,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:16,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:16,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2025-01-10 01:01:16,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:01:16,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 383 flow. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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 01:01:16,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:16,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:01:16,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:20,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:24,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:28,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:32,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:36,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:42,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:54,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:58,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:02:03,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:02:07,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:02:08,141 INFO L124 PetriNetUnfolderBase]: 186/359 cut-off events. [2025-01-10 01:02:08,141 INFO L125 PetriNetUnfolderBase]: For 1799/1799 co-relation queries the response was YES. [2025-01-10 01:02:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 359 events. 186/359 cut-off events. For 1799/1799 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1442 event pairs, 14 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 1829. Up to 196 conditions per place. [2025-01-10 01:02:08,144 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 65 selfloop transitions, 26 changer transitions 9/103 dead transitions. [2025-01-10 01:02:08,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 103 transitions, 1005 flow [2025-01-10 01:02:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:02:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:02:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2025-01-10 01:02:08,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-01-10 01:02:08,146 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 383 flow. Second operand 12 states and 146 transitions. [2025-01-10 01:02:08,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 103 transitions, 1005 flow [2025-01-10 01:02:08,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 900 flow, removed 51 selfloop flow, removed 2 redundant places. [2025-01-10 01:02:08,152 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 587 flow [2025-01-10 01:02:08,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=587, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-01-10 01:02:08,153 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2025-01-10 01:02:08,153 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 587 flow [2025-01-10 01:02:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 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 01:02:08,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:08,153 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:08,162 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 01:02:08,354 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,SelfDestructingSolverStorable6 [2025-01-10 01:02:08,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:02:08,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1543017652, now seen corresponding path program 3 times [2025-01-10 01:02:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-01-10 01:02:08,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:02:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:08,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:02:08,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:08,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:02:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:02:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-01-10 01:02:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930090440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752034780] [2025-01-10 01:02:08,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:02:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:08,466 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 01:02:08,471 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 01:02:08,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:02:08,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:02:08,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:02:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:08,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:02:08,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:02:09,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:02:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752034780] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:09,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2025-01-10 01:02:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955134339] [2025-01-10 01:02:09,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:09,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:02:09,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:09,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:02:09,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:02:09,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 20 [2025-01-10 01:02:09,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 587 flow. Second operand has 15 states, 15 states have (on average 8.333333333333334) internal successors, (125), 15 states have internal predecessors, (125), 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 01:02:09,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:09,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 20 [2025-01-10 01:02:09,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand