./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/dekker-unfair.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:30,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:30,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:30,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:30,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:30,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:30,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:30,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:30,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:30,445 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:30,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:30,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:30,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:30,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:30,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:30,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:30,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:30,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:30,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:30,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:30,449 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 -> 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 [2025-01-10 00:38:30,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:30,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:30,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:30,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:30,631 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:30,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-unfair.i [2025-01-10 00:38:31,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5dae279/cf020e1ede46408091a9f7cf15fb1ad4/FLAG3c7e3fc15 [2025-01-10 00:38:32,125 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:32,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i [2025-01-10 00:38:32,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5dae279/cf020e1ede46408091a9f7cf15fb1ad4/FLAG3c7e3fc15 [2025-01-10 00:38:32,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a5dae279/cf020e1ede46408091a9f7cf15fb1ad4 [2025-01-10 00:38:32,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:32,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:32,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:32,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:32,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:32,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253db154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32, skipping insertion in model container [2025-01-10 00:38:32,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:32,639 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:32,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:32,699 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:32,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32 WrapperNode [2025-01-10 00:38:32,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:32,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:32,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:32,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:32,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,723 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-01-10 00:38:32,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:32,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:32,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:32,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:32,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,746 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 00:38:32,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:32,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:32,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:32,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:32,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (1/1) ... [2025-01-10 00:38:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:32,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:32,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-10 00:38:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-10 00:38:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:32,817 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:32,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:32,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:33,045 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:33,045 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:33,174 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:33,174 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:38:33,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:33 BoogieIcfgContainer [2025-01-10 00:38:33,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:33,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:33,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:33,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:33,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:32" (1/3) ... [2025-01-10 00:38:33,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8bf255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:33, skipping insertion in model container [2025-01-10 00:38:33,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:32" (2/3) ... [2025-01-10 00:38:33,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8bf255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:33, skipping insertion in model container [2025-01-10 00:38:33,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:33" (3/3) ... [2025-01-10 00:38:33,187 INFO L128 eAbstractionObserver]: Analyzing ICFG dekker-unfair.i [2025-01-10 00:38:33,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:33,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dekker-unfair.i that has 3 procedures, 43 locations, 1 initial locations, 4 loop locations, and 3 error locations. [2025-01-10 00:38:33,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:33,275 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:38:33,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 52 transitions, 118 flow [2025-01-10 00:38:33,321 INFO L124 PetriNetUnfolderBase]: 10/50 cut-off events. [2025-01-10 00:38:33,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:33,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 10/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-01-10 00:38:33,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 52 transitions, 118 flow [2025-01-10 00:38:33,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 49 transitions, 110 flow [2025-01-10 00:38:33,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:33,345 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;@146cef55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:33,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:38:33,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:33,351 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-01-10 00:38:33,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:33,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:33,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:33,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1555264985, now seen corresponding path program 1 times [2025-01-10 00:38:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717007199] [2025-01-10 00:38:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:33,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:33,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717007199] [2025-01-10 00:38:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717007199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320309604] [2025-01-10 00:38:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:33,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:33,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:33,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2025-01-10 00:38:33,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:33,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2025-01-10 00:38:33,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:33,589 INFO L124 PetriNetUnfolderBase]: 70/229 cut-off events. [2025-01-10 00:38:33,589 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 00:38:33,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 229 events. 70/229 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1193 event pairs, 20 based on Foata normal form. 56/254 useless extension candidates. Maximal degree in co-relation 319. Up to 72 conditions per place. [2025-01-10 00:38:33,592 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 18 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-01-10 00:38:33,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 160 flow [2025-01-10 00:38:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 00:38:33,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2025-01-10 00:38:33,601 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 110 flow. Second operand 3 states and 128 transitions. [2025-01-10 00:38:33,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 160 flow [2025-01-10 00:38:33,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:33,606 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 110 flow [2025-01-10 00:38:33,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2025-01-10 00:38:33,610 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-01-10 00:38:33,610 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 110 flow [2025-01-10 00:38:33,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:33,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:33,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:33,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1315199871, now seen corresponding path program 1 times [2025-01-10 00:38:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846594255] [2025-01-10 00:38:33,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:33,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:38:33,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:38:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:33,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846594255] [2025-01-10 00:38:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846594255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:33,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:33,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926887597] [2025-01-10 00:38:33,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:33,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:33,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:33,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:33,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:33,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2025-01-10 00:38:33,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:33,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2025-01-10 00:38:33,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:33,731 INFO L124 PetriNetUnfolderBase]: 63/228 cut-off events. [2025-01-10 00:38:33,731 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 00:38:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 228 events. 63/228 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1178 event pairs, 30 based on Foata normal form. 15/228 useless extension candidates. Maximal degree in co-relation 96. Up to 81 conditions per place. [2025-01-10 00:38:33,734 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 18 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 00:38:33,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 162 flow [2025-01-10 00:38:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-01-10 00:38:33,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2025-01-10 00:38:33,735 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 110 flow. Second operand 3 states and 121 transitions. [2025-01-10 00:38:33,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 162 flow [2025-01-10 00:38:33,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:33,737 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 114 flow [2025-01-10 00:38:33,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-01-10 00:38:33,737 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-01-10 00:38:33,737 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 114 flow [2025-01-10 00:38:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:33,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:33,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash 358484271, now seen corresponding path program 1 times [2025-01-10 00:38:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582005924] [2025-01-10 00:38:33,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:33,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:33,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:33,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:33,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582005924] [2025-01-10 00:38:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582005924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406820150] [2025-01-10 00:38:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:33,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:33,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:33,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:33,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 52 [2025-01-10 00:38:33,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:33,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 52 [2025-01-10 00:38:33,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:33,887 INFO L124 PetriNetUnfolderBase]: 90/247 cut-off events. [2025-01-10 00:38:33,887 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-01-10 00:38:33,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 247 events. 90/247 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1163 event pairs, 42 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 156. Up to 104 conditions per place. [2025-01-10 00:38:33,891 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 18 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-10 00:38:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 163 flow [2025-01-10 00:38:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-10 00:38:33,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-01-10 00:38:33,894 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 114 flow. Second operand 3 states and 112 transitions. [2025-01-10 00:38:33,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 163 flow [2025-01-10 00:38:33,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:33,897 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 118 flow [2025-01-10 00:38:33,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-01-10 00:38:33,898 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-01-10 00:38:33,898 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 118 flow [2025-01-10 00:38:33,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:33,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:33,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:33,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:33,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1485428249, now seen corresponding path program 1 times [2025-01-10 00:38:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673917689] [2025-01-10 00:38:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:38:33,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:38:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673917689] [2025-01-10 00:38:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673917689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:33,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:33,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410204686] [2025-01-10 00:38:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:33,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:33,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:33,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 52 [2025-01-10 00:38:33,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:33,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:33,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 52 [2025-01-10 00:38:33,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:34,036 INFO L124 PetriNetUnfolderBase]: 75/205 cut-off events. [2025-01-10 00:38:34,037 INFO L125 PetriNetUnfolderBase]: For 80/92 co-relation queries the response was YES. [2025-01-10 00:38:34,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 205 events. 75/205 cut-off events. For 80/92 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 876 event pairs, 37 based on Foata normal form. 5/185 useless extension candidates. Maximal degree in co-relation 189. Up to 83 conditions per place. [2025-01-10 00:38:34,040 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 15 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-01-10 00:38:34,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 155 flow [2025-01-10 00:38:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:38:34,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2025-01-10 00:38:34,042 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 118 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:38:34,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 155 flow [2025-01-10 00:38:34,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 143 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:34,045 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 114 flow [2025-01-10 00:38:34,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-01-10 00:38:34,046 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-01-10 00:38:34,046 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 114 flow [2025-01-10 00:38:34,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:34,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:34,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:34,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:34,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:38:34,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:34,047 INFO L85 PathProgramCache]: Analyzing trace with hash 300233911, now seen corresponding path program 1 times [2025-01-10 00:38:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:34,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142816406] [2025-01-10 00:38:34,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:34,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:38:34,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:38:34,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:34,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142816406] [2025-01-10 00:38:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142816406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:34,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000611028] [2025-01-10 00:38:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:34,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:34,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:34,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:34,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2025-01-10 00:38:34,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:34,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:34,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2025-01-10 00:38:34,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:34,111 INFO L124 PetriNetUnfolderBase]: 53/162 cut-off events. [2025-01-10 00:38:34,111 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2025-01-10 00:38:34,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 162 events. 53/162 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 687 event pairs, 29 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 130. Up to 79 conditions per place. [2025-01-10 00:38:34,112 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2025-01-10 00:38:34,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 136 flow [2025-01-10 00:38:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-10 00:38:34,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2025-01-10 00:38:34,113 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 114 flow. Second operand 3 states and 111 transitions. [2025-01-10 00:38:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 136 flow [2025-01-10 00:38:34,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 123 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:34,114 INFO L231 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2025-01-10 00:38:34,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2025-01-10 00:38:34,115 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-01-10 00:38:34,115 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2025-01-10 00:38:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:34,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:38:34,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:38:34,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:34,123 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:38:34,127 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:38:34,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:38:34,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:38:34 BasicIcfg [2025-01-10 00:38:34,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:38:34,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:38:34,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:38:34,136 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:38:34,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:33" (3/4) ... [2025-01-10 00:38:34,137 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:38:34,143 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-01-10 00:38:34,143 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-01-10 00:38:34,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-01-10 00:38:34,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 00:38:34,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:38:34,146 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:38:34,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:38:34,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:38:34,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:38:34,205 INFO L158 Benchmark]: Toolchain (without parser) took 1818.91ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 48.2MB in the end (delta: 64.8MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,205 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:34,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.33ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 93.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,206 INFO L158 Benchmark]: Boogie Preprocessor took 40.59ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:34,206 INFO L158 Benchmark]: RCFGBuilder took 409.37ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 71.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,207 INFO L158 Benchmark]: TraceAbstraction took 959.71ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 53.6MB in the end (delta: 16.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,207 INFO L158 Benchmark]: Witness Printer took 67.44ms. Allocated memory is still 142.6MB. Free memory was 53.6MB in the beginning and 48.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:34,209 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.33ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 93.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.59ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 409.37ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 71.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 959.71ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 53.6MB in the end (delta: 16.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Witness Printer took 67.44ms. Allocated memory is still 142.6MB. Free memory was 53.6MB in the beginning and 48.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 779]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 77 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 7 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:38:34,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE